title: How is Greedy Technique different from Exhaustive Search?
body: <p>I have some sample problems that I'm writing pseudo code for and I'm noticing alarming patterns between the greedy technique and exhaustive search.</p>
  
  <pre><code>       Job 1, Job 2, Job 3, Job 4, Job 5
  Person:  1     9     2      7      8
  Person:  2     6     4      3      7
  Person:  3     5     8      1      8
  Person:  4     7     6      9      4 
  </code></pre>
  
  <p>The above is the table example of an assignment problem. Basically, you have n amount of jobs to do, five here, and you need to complete them in the smallest amount of them were time is shown by the values attached to each person and their job in the table. </p>
  
  <p>It seems to be that the only difference in the exhaustive search and the greedy technique are the data structures used by both to solve the problems. Greedy uses weighted graphs while exhaustive uses arrays. Does this happen a lot in our algorithms? Do many algorithms mimic each other closely yet simply use more efficient data structures to accomplish our problems?</p>