Algorithms

Name the different types of searching algorithms

• Binary search

• Linear search

Name different types of sorting algorithms

• Merge sort

• Bubble sort

• Insertion sort

What is a linear search?

Starts at the first value in the data set and checks every value one at a time until the value you are looking for is found.

How is a linear search done?

1. Check the first value, if it is the data you are looking for the search ends.

2. If it is not, repeat this with all the values until the data is found.

What is a binary search?

Halves the data set with the middle value, go left if the value is smaller but right when bigger.

How is a binary search is done?

1. Identify the middle value

2. Compare the value to see if it is bigger or smaller

3. If the value is smaller, go left and create a new list with the numbers of the right including the middle value.

4. Repeat this instructions until the value you are looking for is set to be the middle value.

What is an algorithm?

A set of detailed instructions that are set for a computer to follow as efficiently as possible.

How is a merge sort done?

1. Breaks down a large, unsorted list into individual elements.

2. Merges them into sub lists that are organized.

3. Merges the sub lists into a bigger list until everything is in order.

How is a bubble sort done?

1. Compares two pairs to check if they need to swap into place them into ascending order.

2. Move down the list until every pair is in order

3. Check one last time if everything is sorted.

How is an insertion sort done?

1. Begin with the second unit in the list and compare it with the units next to it

2. If the item on the right is smaller to it, insert the unit to have an ascending list

3. Continue the comparison with each number until everything is sorted.