Searching and sorting algorithms

Question 1

Methods for sorting algorithms

Answer 1

• Bubble sort
• Merge sort
• Insertion sort

Question 2

Methods for searching algorithms

Answer 2

• Binary search
• linear search

Question 3

How does binary search work

Answer 3

Splits the data set in half and compares if the number is greater or smaller than the number they are finding, gets rid of half the list and splits it again comparing if it is greater than or smaller than until it has found the correct number

Question 4

Advantages and disadvantages of a binary search

Answer 4

• Much more efficient than a linear search
• But the list must be ordered

Question 5

How does a linear search work

Answer 5

Starts at the beginning of the data set and compares each number to the one it is searching for

Question 6

Advantages and disadvantages of a linear seach

Answer 6

• very simple
• Can be very inefficient if the number is at the end of a long list
• The data set does not have to be ordered

Question 7

How does a bubble sort work

Answer 7

Starts at the beginning of the list and compares the number with the one next to it and makes a switch if it is larger.
it then moves to the second value and compares
It continues this until there is no more items to compare
After the first pass a second pass is completed to ensure it is all sorted

Question 8

Advantages and disadvantages of a bubble sort

Answer 8

• It is popular and easy to implement
• Does not deal well with large lists

Question 9

How does a merge sort work

Answer 9

• It uses a method called divide and conquer
• The list is repeatedly divided into two until all the items are separate
• Pairs of elements are then compared, this process is repeated until the list is recompiled

Question 10

Advantages and disadvantages of a merge sort

Answer 10

• reliable efficiency
• Excellent choice for large datasets
• Not the most space efficient algorithm

Question 11

How does an insertion sort work

Answer 11

• Compares values in turn
• Starts on the second value and compares if it is bigger than the first value
• If it is it moves onto the third value and compares if that is bigger than the second value
• If one value is greater it will then be compared with all the previous values

Question 12

Advantages and disadvantages of an insertion sort

Answer 12

• Less complex and efficient as a merge sort
• More efficient than a bubble sort
• Works best with smaller data sets