Sorting</h1> <article> <h1>Sorting</h1> <p>Mon, 01 Jan 0001 00:00:00 +0000</p> <blockquote> <p>[!important] Sorting Guide</p> <p>For more information about specific sorting algorithms covered in 61B, see my <a href="https://docs.google.com/document/d/1dUfzdh5V3okrwFbB9o0PgtEBaLHyCqJFwpQWyQ53IeU/edit" rel="noopener">guide on sorting</a> that covers all of the sorts in far greater detail 🙂</p> </blockquote> <h2 id="why-sort"> Why sort? <a class="anchor" href="#why-sort">#</a> </h2> <ul> <li>It makes searching for a specific value much faster (e.g. binary search). Typically, searching through an unsorted list requires a full scan ($\Theta(N)$ runtime).</li> <li>It’s easy to see if two items in list are equal: just compare to see if any neighboring values are the same.</li> </ul> <h2 id="properties-of-a-sorting-algorithm"> Properties of a Sorting Algorithm <a class="anchor" href="#properties-of-a-sorting-algorithm">#</a> </h2> <p>A sorting algorithm changes a sequence based on a <strong>total order.</strong> A total order is:</p> </article> <article> <h1>Minimax Algorithm</h1> <p>Mon, 01 Jan 0001 00:00:00 +0000</p> <h2 id="game-trees"> Game Trees <a class="anchor" href="#game-trees">#</a> </h2> <p>The Minimax algorithm is often used for making AI’s for turn-based games. It relies on the use of a type of <strong>game tree,</strong> which maps out all of the possible moves that players can make.</p> <p>In the tree, there are two types of nodes: <strong>maximizing nodes</strong> and <strong>minimizing nodes.</strong> The max-nodes represent <strong>you</strong>- you want to make your position as advantageous as possible (maximizing your score). The min-nodes represent <strong>your opponent-</strong> they want to make you do as poorly as possible (minimizing your score).</p> </article> </main></body></html>