<?xml version="1.0" encoding="UTF-8"?>
<!-- generator="FeedCreator 1.8" -->
<?xml-stylesheet href="http://servo.ad.wlu.edu/dokuwiki/lib/exe/css.php?s=feed" type="text/css"?>
<rdf:RDF
    xmlns="http://purl.org/rss/1.0/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
    xmlns:dc="http://purl.org/dc/elements/1.1/">
    <channel rdf:about="http://servo.ad.wlu.edu/dokuwiki/feed.php">
        <title>W&amp;L Computer Science Wiki - courses:cs211:winter2018:journals:cantrella</title>
        <description></description>
        <link>http://servo.ad.wlu.edu/dokuwiki/</link>
        <image rdf:resource="http://servo.ad.wlu.edu/dokuwiki/lib/exe/fetch.php/wiki/dokuwiki-128.png" />
       <dc:date>2026-05-11T23:17:27+00:00</dc:date>
        <items>
            <rdf:Seq>
                <rdf:li rdf:resource="http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2018/journals/cantrella/chapter_1?rev=1516056419&amp;do=diff"/>
                <rdf:li rdf:resource="http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2018/journals/cantrella/chapter_2?rev=1517185939&amp;do=diff"/>
                <rdf:li rdf:resource="http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2018/journals/cantrella/chapter_3?rev=1517955609&amp;do=diff"/>
                <rdf:li rdf:resource="http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2018/journals/cantrella/chapter_4?rev=1520869934&amp;do=diff"/>
                <rdf:li rdf:resource="http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2018/journals/cantrella/chapter_5?rev=1520904726&amp;do=diff"/>
                <rdf:li rdf:resource="http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2018/journals/cantrella/home?rev=1520869996&amp;do=diff"/>
                <rdf:li rdf:resource="http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2018/journals/cantrella/prelude?rev=1517286109&amp;do=diff"/>
                <rdf:li rdf:resource="http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2018/journals/cantrella/sidebar?rev=1520870097&amp;do=diff"/>
            </rdf:Seq>
        </items>
    </channel>
    <image rdf:about="http://servo.ad.wlu.edu/dokuwiki/lib/exe/fetch.php/wiki/dokuwiki-128.png">
        <title>W&L Computer Science Wiki</title>
        <link>http://servo.ad.wlu.edu/dokuwiki/</link>
        <url>http://servo.ad.wlu.edu/dokuwiki/lib/exe/fetch.php/wiki/dokuwiki-128.png</url>
    </image>
    <item rdf:about="http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2018/journals/cantrella/chapter_1?rev=1516056419&amp;do=diff">
        <dc:format>text/html</dc:format>
        <dc:date>2018-01-15T22:46:59+00:00</dc:date>
        <dc:creator>Anonymous (anonymous@undisclosed.example.com)</dc:creator>
        <title>chapter_1</title>
        <link>http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2018/journals/cantrella/chapter_1?rev=1516056419&amp;do=diff</link>
        <description>Chapter 1

Section 1.1

The algorithm presented in section 1.1 is a solution to the stable matching problem. The algorithm assumes there are two sets of people, one of n men and one of n women. Each man in the set ranks each woman from 1 to n while the women do the same for the men. Using the sets of men and women and each person&#039;s preferences, the algorithm generates a set of pairs that match each man to each woman according to their preferences.</description>
    </item>
    <item rdf:about="http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2018/journals/cantrella/chapter_2?rev=1517185939&amp;do=diff">
        <dc:format>text/html</dc:format>
        <dc:date>2018-01-29T00:32:19+00:00</dc:date>
        <dc:creator>Anonymous (anonymous@undisclosed.example.com)</dc:creator>
        <title>chapter_2</title>
        <link>http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2018/journals/cantrella/chapter_2?rev=1517185939&amp;do=diff</link>
        <description>Chapter 2

Section 2.1

 The goal of section 2.1 is to define just what exactly makes an algorithm efficient and how to measure that efficiency. The section starts with a very broad and subjective definition of efficiency and goes on to explain that while the first definition makes logical sense, it&#039;s wording is too loose and thus hard to measure quantitatively. The second definition makes progress by defining an efficient algorithm as one that performs better than a brute-force search. Brute-fo…</description>
    </item>
    <item rdf:about="http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2018/journals/cantrella/chapter_3?rev=1517955609&amp;do=diff">
        <dc:format>text/html</dc:format>
        <dc:date>2018-02-06T22:20:09+00:00</dc:date>
        <dc:creator>Anonymous (anonymous@undisclosed.example.com)</dc:creator>
        <title>chapter_3</title>
        <link>http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2018/journals/cantrella/chapter_3?rev=1517955609&amp;do=diff</link>
        <description>Chapter 3

Section 3.1

Section 3.1 covers the introduction to graphs, the syntax associated with them, and their applications in real-world settings. Graphs have been implemented in computer science because of their natural prevalence in our everyday lives. Some of the examples the book gave were airplanes and airports, computer networks, and social networks. Types of graphs covered were undirected and directed edge graphs and the special kind of graph called a tree.</description>
    </item>
    <item rdf:about="http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2018/journals/cantrella/chapter_4?rev=1520869934&amp;do=diff">
        <dc:format>text/html</dc:format>
        <dc:date>2018-03-12T15:52:14+00:00</dc:date>
        <dc:creator>Anonymous (anonymous@undisclosed.example.com)</dc:creator>
        <title>chapter_4</title>
        <link>http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2018/journals/cantrella/chapter_4?rev=1520869934&amp;do=diff</link>
        <description>Chapter 4

Section 4.1

Section 4.1 covers the introduction to greedy algorithms using the basic “staying ahead” mentality. There are two specific algorithms that are introduced in this section. The first is the interval scheduling algorithm which returns the optimal schedule of intervals from some given set of intervals. The algorithm works by finding the interval that has the earliest finishing time, removing all intervals that conflict with the chosen intervals, and then recursing through the…</description>
    </item>
    <item rdf:about="http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2018/journals/cantrella/chapter_5?rev=1520904726&amp;do=diff">
        <dc:format>text/html</dc:format>
        <dc:date>2018-03-13T01:32:06+00:00</dc:date>
        <dc:creator>Anonymous (anonymous@undisclosed.example.com)</dc:creator>
        <title>chapter_5</title>
        <link>http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2018/journals/cantrella/chapter_5?rev=1520904726&amp;do=diff</link>
        <description>Chapter 5

Section 5.1

Section 5.1 introduces the divide and conquer style of algorithmic problem solving with the Merge-Sort algorithm. The algorithm can be represented by the following recurrence equation: T(n) = 2T(n/2) + cn for all n &gt; 2. This algorithm basically splits the list of items down recursively until it gets to a</description>
    </item>
    <item rdf:about="http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2018/journals/cantrella/home?rev=1520869996&amp;do=diff">
        <dc:format>text/html</dc:format>
        <dc:date>2018-03-12T15:53:16+00:00</dc:date>
        <dc:creator>Anonymous (anonymous@undisclosed.example.com)</dc:creator>
        <title>home</title>
        <link>http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2018/journals/cantrella/home?rev=1520869996&amp;do=diff</link>
        <description>Alex&#039;s Wiki

	*  Prelude
	*  Chapter 1
	*  Chapter 2
	*  Chapter 3
	*  Chapter 4
	*  Chapter 5</description>
    </item>
    <item rdf:about="http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2018/journals/cantrella/prelude?rev=1517286109&amp;do=diff">
        <dc:format>text/html</dc:format>
        <dc:date>2018-01-30T04:21:49+00:00</dc:date>
        <dc:creator>Anonymous (anonymous@undisclosed.example.com)</dc:creator>
        <title>prelude</title>
        <link>http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2018/journals/cantrella/prelude?rev=1517286109&amp;do=diff</link>
        <description>Prelude

I should probably put something here shouldn&#039;t I...

UPDATE: Here&#039;s my doggo :)



Well, since I couldn&#039;t think of anything, here&#039;s a picture of a lion and tiger cuddling.</description>
    </item>
    <item rdf:about="http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2018/journals/cantrella/sidebar?rev=1520870097&amp;do=diff">
        <dc:format>text/html</dc:format>
        <dc:date>2018-03-12T15:54:57+00:00</dc:date>
        <dc:creator>Anonymous (anonymous@undisclosed.example.com)</dc:creator>
        <title>sidebar</title>
        <link>http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2018/journals/cantrella/sidebar?rev=1520870097&amp;do=diff</link>
        <description>Alex&#039;s Wiki

	*  Prelude
	*  Chapter 1
	*  Chapter 2
	*  Chapter 3
	*  Chapter 4
	*  Chapter 5

----------

&lt;- Alex&#039;s Wiki

&lt;- CSCI 211: Algorithm Design and Analysis</description>
    </item>
</rdf:RDF>
