2.1.3 Searching and Sorting algorithms

Question 1

What are the two searching algorithms?

Answer 1

Binary search
Linear search

Question 2

What is a Binary search?

Answer 2

looks for a specific value in an ordered or sorted list

Question 2

What is a Binary search?

Answer 2

looks for a specific value in an ordered or sorted list

Question 3

How does a binary search take place?

Answer 3

Comparing it with the middle or median value and deciding if it is higher or lower

Taking the half of the list that is higher or lower and once again finding and comparing it with the middle or median value

Repeating this process until the specific value is found

Question 4

How does a linear search take place?

Answer 4

takes each value in a list, one at a time, and compares it with the value required, this is repeated until the correct value is found

Question 5

What are the characteristics of a linear search?

Answer 5

process can be very slow, especially with large data sets

Question 6

How does a bubble sort take place?

Answer 6

The first two values in a list are compared with each other and are swapped if they are in the wrong order. Then the next pair of values is checked and their order in the list is swapped, if required. This process is repeated unto no further swapes are needed and the list is sorted

Question 7

How does a Merge sort take place?

Answer 7

data is repeatedly split into halves until each list contains only one item. The items are then merged into the order required.

Question 8

How does an Insertion sort take place?

Answer 8

Each item in an unordered list is examined in turn and compared with the previous items in the list. Higher values than those before them are left in the same position, but lower values are compared with each in turn until they can be inserted into the correct place. This process is repeated until all items have been examined and inserted into their correct position, in ascending order.