SEARCHING AND STORING ALGORITHMS

Question 1

What is linear search?

Answer 1

the process of starting at the beginning of the list and chronologically going through the list checking it against a criteria set

Question 2

What is the advantages and disadvantages of a linear search?

Answer 2

A) easy to code, performs well with small and medium lists, does not break when new things are added into the list
D)slow to process large lists

Question 3

What is binary search?

Answer 3

It the process of searching through larger data sets, the data is arranged in order. it works by finding the midpoint and asking whether its in the upper or lower parts of the sequence, then its repeated until it is found

Question 4

What are the advantages and disadvantages of binary search?

Answer 4

A)good with larger lists
D)the list does not need to be in order, its a more complicated code, if stuff its added it gets slower

Question 5

What is a merge sort?

Answer 5

its the process of breaking downs list by dividing them into 2 each time and it keeps going until it forms a lift of its own

Question 6

What are the advantages and disadvantages of a merge sort?

Answer 6

A)fastest type of sort
D)more complicated compared to other