2.1.3. searching and sorting

2.1.3. searching and sorting

1. Algorithmc thinking

   • A way of getting to a solution by identifying the individual steps. Following a set of riles, an algorithm can be made which leads to an answer.

2. Abstraction

   • Removing unnecessary details of a problem to focus on the important aspects.

3. Binary search

   • You have to calculate the mid-poit of a data set and see if the item required is bigger or smaller than the m.p. Repeat until the ithem is found
   • Needs the data set to be in order.

4. Decomposition

   • It makes problems easier to solve and any program components developed in 1 program can be used in other programs.
   • Breaking a complex problem down into smaller, more manageable sub-problems.
   • Various people can work on different parts simultaneously, reducing development time.

5. Linear search

   • Starting from the beginning of a data set , each item is checked in turn to see if it is the item required.
   • Does not need the data set to be in order and it works best on small data sets.