2.1.3 Searching and sorting

2.1.3 Searching and sorting

1. Sorting is putting items in order.

   • There are many standard algorithms that can be used to sort data, such as bubble sort and merge sort.

2. Ascending is when you go from a low value to a high value.

   • Descending is when you go from a high value to a low value.
     • The binary search will cut in half the index and read the value. If the value does not match the designated value it will half the list again in terms of the biggest or smallest.

3. Bubble sort is a basic algorithm for arranging a string of numbers or other elements in the correct order.

   • The algorithm iterates through the list multiple times until no more swaps are needed, resulting in a sorted sequence.

4. An insertion sort compares values in turn, starting with the second value in the list.

5. A merge sort uses a technique called divide and conquer. The list is repeatedly divided into two until all the elements are separated individually.

6. Binary search is an efficient algorithm for finding an item from a sorted list of items.

   • repeatedly dividing in half the portion of the list that could contain the item, until you've narrowed down the possible locations to just one.

7. An insertion sort compares values in turn, starting with the second value in the list.