https://cswiki.wlu.edu/dokuwiki/ 2026-05-11T18:31:14+00:00 https://cswiki.wlu.edu/dokuwiki/ https://cswiki.wlu.edu/dokuwiki/lib/exe/fetch.php/wiki/dokuwiki-128.png text/html 2018-01-28T19:23:21+00:00 Anonymous (anonymous@undisclosed.example.com) https://cswiki.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2018/journals/lesherr/home/chapter1?rev=1517167401&do=diff Chapter 1: Introduction Section 1: Stable Matching The motivation for the Gale-Shapley Stable Matching Problem was to design a college admission process/job recruiting process that was self-enforcing. By self-enforcing, they looked to find a stable matching in which individual self-interest prevented any changing/switching behind the scenes from happening. This meant that everyone was happy/satisfied with their current position, and there did not exist a pair that both preferred the same sepa… text/html 2018-01-28T19:23:33+00:00 Anonymous (anonymous@undisclosed.example.com) https://cswiki.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2018/journals/lesherr/home/chapter2?rev=1517167413&do=diff Chapter 2: Basics of Algorithm Analysis Section 1: Computational Tractability The first major question that needs to be answered in discussing algorithms is how to define what an efficient algorithm is. At first, it can be defined as an algorithm that, when implemented, runs quickly on real input instances. While this definition does highlight an important characteristic of an efficient algorithm, it does not fully encapsulate what it means to be efficient. The first missing piece of informa… text/html 2018-02-05T00:19:11+00:00 Anonymous (anonymous@undisclosed.example.com) https://cswiki.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2018/journals/lesherr/home/chapter3?rev=1517789951&do=diff Chapter 3: Graphs Section 1: Basic Definitions and Applications A graph is a data structure that provides a way of “encoding pairwise relationships among a set of objects”. It contains a set of nodes, which can also be called vertices, and collection of edges, where each edge joins a pair of nodes. If you are creating a graph where edges indicate a text/html 2018-03-11T16:30:38+00:00 Anonymous (anonymous@undisclosed.example.com) https://cswiki.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2018/journals/lesherr/home/chapter4?rev=1520785838&do=diff Chapter 4: Greedy Algorithms Section 1: Interval Scheduling: The Greedy Algorithm Stays Ahead The Interval Scheduling Problem consists of a set of requests {1,2,...,n}, where the ith request corresponds to an interval of time starting at s(i) and finishing at f(i). When utilizing a greedy algorithm for the interval scheduling problem, we want to define a simple rule to select a first request. Once the first request is accepted, all other requests that are not compatible with the first request … text/html 2018-03-11T17:14:19+00:00 Anonymous (anonymous@undisclosed.example.com) https://cswiki.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2018/journals/lesherr/home/chapter5?rev=1520788459&do=diff Chapter 5: Divide and Conquer Section 1: A First Recurrence: The Mergesort Algorithm 'The Mergesort Algorithm sorts a given list of numbers by first dividing them into two equal halves, sorting each half separately by recursion, and then combining the results of these recursive halves.' The abstract behavioral template for many common divide-and-conquer algorithms is this: 'Divide the input into two pieces of equal size; solve the two subproblems on these pieces separately by recursion; and th… text/html 2018-03-26T14:32:21+00:00 Anonymous (anonymous@undisclosed.example.com) https://cswiki.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2018/journals/lesherr/home/chapter6?rev=1522074741&do=diff Chapter 6: Dynamic Programming Section 1: Weighted Interval Scheduling - A Recursive Procedure In previous chapters, we discovered that we can use a greedy approach to this problem to find an optimal solution to the generic Interval Scheduling Problem. We will now look at the Weighted Interval Scheduling Problem, where each interval is assigned a particular value or weight, and we are looking to maximize the total value scheduled. The original Interval Scheduling Problem addresses a special ca… text/html 2018-04-02T00:24:07+00:00 Anonymous (anonymous@undisclosed.example.com) https://cswiki.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2018/journals/lesherr/home/chapter7?rev=1522628647&do=diff Chapter 7: Network Flow Section 1: The Maximum-Flow Problem and the Ford-Fulkerson Algorithm Graphs are often useful in modeling transportation networks, where the edges carry traffic and each node acts as a switch that passes traffic between different edges. This system can thought of as a highway system where the edges represent the highways themselves, and nodes represent the interchanges between the highways, or also as a fluid network where the edges are pipes that carry fluid and the nod… text/html 2018-01-14T20:33:51+00:00 Anonymous (anonymous@undisclosed.example.com) https://cswiki.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2018/journals/lesherr/home/preface?rev=1515962031&do=diff Preface The preface provided a very descriptive overview of the purpose of the analysis of algorithms, and their overall application into many different fields. Algorithmic ideas are not solely constricted to the field of computer science, but reach into almost all fields across the market. However, the main root of algorithms does stem from the text/html 2018-01-14T20:03:06+00:00 Anonymous (anonymous@undisclosed.example.com) https://cswiki.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2018/journals/lesherr/home/prelude?rev=1515960186&do=diff **__Preface__** The preface provided a very descriptive overview of the purpose of the analysis of algorithms, and their overall application into many different fields. Algorithmic ideas are not solely constricted to the field of computer science, but reach into almost all fields across the market. However, the main root of algorithms does stem from the "heart of computer science". Algorithms consist of two main components: the mathematical component of the problem, and the design techniqu… text/html 2018-04-01T22:29:54+00:00 Anonymous (anonymous@undisclosed.example.com) https://cswiki.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2018/journals/lesherr/home/sidebar?rev=1522621794&do=diff Ryan's wiki * Preface * Chapter 1: Introduction * Chapter 2: Basics of Algorithm Analysis * Chapter 3: Graphs * Chapter 4: Greedy Algorithms * Chapter 5: Divide and Conquer * Chapter 6: Dynamic Programming * Chapter 7: Network Flow ---------- <- Ryan's wiki <- CSCI 211: Algorithm Design and Analysis