Searching And Sorting Algorithms Y9

Question 1

What is linear search

Answer 1

The computer checks each individual item on the list, and compares it to the value being looked for, it then moves on to the next value if not found.

Question 2

Why is linear search inefficient

Answer 2

Large lists mean that the search would take a while to finish

Question 3

What is binary search

Answer 3

List has to be in order(number or alphabetical order)
Computer checks middle value and compares it-if the number/alphabet is higher than it finds the middle of the second half
Keeps doing this until value found

Question 4

Wha has to happen before binary search can take place

Answer 4

List needs to be in order

Question 5

What happens if there is an even number for binary search(which ones the middle)

Answer 5

The one on the left

Question 6

Why is binary search more efficient than linear search

Answer 6

Binary search looks at significantly less values than linear. Making the process quicker

Question 7

Why do we use sorting algorithms

Answer 7

To put a list of items in order (alphabetically or numerically)

Question 8

What is the bubble sort algorithm

Answer 8

Compares first two numbers and will swap them if needed (if the value on the one on the right is lower than the one on the left)
Then repeats with second and third number.
This repeats until end of list
Then goes to start of list and redoes it all(ordering again)
Keeps going from start until all in order (there will be one check)

Question 9

How efficient is bubble sort

Answer 9

Very inefficient

Question 10

What is merge sort

Answer 10

Divide the list in half
And in half again
Keep dividing in half until values are separated
Then start merging them back together
Ordering the values as you go along

Question 11

Which one is more efficient merge or insertion sort

Answer 11

Merge

Question 12

Which sort is most complicated

Answer 12

Merge

Question 12

What is insertion sort

Answer 12

Takes first number of list and adds it to the sorted list
Takes the second and puts it in the sorted list (placing it in order)
Keep going from doing this one at a time until all are sorted

Question 13

Advantages of bubble sort

Answer 13

Simple and easiest to code

Question 14

Disadvantages of bubble sort

Answer 14

Slowest

Question 15

Advantages of insertion sort

Answer 15

Simple and easy to code

Question 16

Disadvantages of insertion sort

Answer 16

Twice as fast as bubble but slower than merge

Question 17

Advantages of merge sort

Answer 17

Fastest.

Question 18

Disadvantages of merge sort

Answer 18

More difficult to code than the other two and it requires more memory