Algorithms

Question 1

Explain the steps of binary search

Answer 1

• Binary search is more efficient than linear search
• In binary search, the list must be ordered
• First, the middle term of the list is compared with the target term. If the term matches the target then the index is returned
• If not, the top half of the list is ignored if the target term is less than the middle term
• If the target term is greater than the middle term, the bottom half of the list is ignored
• This is repeated until the target term is found

Question 2

Explain the steps of linear search

Answer 2

• Each item in the list is compared with the search item. If it does not match, the next term is compared

Question 3

Explain the stages of bubble sort

Answer 3

• Starting at the beginning, two adjacent terms are compared with eachother and then sorted in order
• The last term of the first comparison is then compared with the next adjacent term, ordering them aswell
• Once the end of the list has been reached, the last term will be in the correct place. The algorithm then resets for another pass

Question 4

Explain the steps of insertion sort

Answer 4

• Starts with one of the items from the list
• The next item is compared with the first item. If it is greater than the first item is shifted to the left and the next item takes its place. if the next item is less than the first item than the first item is shifted to the right and the next item takes its place
• This is repeated until the list is ordered

Question 5

Explain the steps of merge sort

Answer 5

• The list is broken up into individual terms
• Adjacent terms (in twos) are put back together in order, creating many mini lists
• Adjacent mini lists are then compared and put back together in order
• This is repeated until the whole list is back together in order