Algorithms For Dummies

Ordering data naïvely

Ordering data naively means to order it using brute-force methods — without any 

regard whatsoever to making any kind of guess as to where the data should appear 

in the list. In addition, these techniques tend to work with the entire dataset 

instead of applying approaches that would likely reduce sorting time (such as the 

divide and conquer technique described in Chapter 5). However, these searches are 

also  relatively  easy  to  understand,  and  they  use  resources  efficiently.  Conse-

quently, you shouldn’t rule them out completely. Even though many searches fall 

into this category, the following sections look at the two most popular approaches.

---

136

 

   

  PART 2