Algorithms

Question 1

Does the data set need to be ordered for linear search?

Answer 1

No.

Question 2

How does linear search work?

Answer 2

Get element.
If equal, report found.
If not equal, move to next element.
Repeat until found/end of list.

Question 3

Does data set need to be ordered for binary search?

Answer 3

Yes.

Question 4

How does binary search work?

Answer 4

Find midpoint –> (start + end)DIV2
If equal to midpoint, report found
If less than midpoint, end = midpoint - 1
If greater than midpoint, beginning = midpoint + 1
Repeat with sublist until found / sublist empty

Question 5

How does insertion sort work?

Answer 5

Set the first item as being in the sorted list, while remaining items are in the unsorted list.

While unsorted list has items
- Take first item of unsorted list
While there is an item to the left which is smaller than itself
- swap with that item
Endwhile
Sorted list is now one item bigger
Endwhile