2.1.3

Question 1

what are the different searching algorithms?

Answer 1

-linear search
-binary search

Question 2

linear search

Answer 2

starts with the first item in a list and compares them to the search criteria one after the other

Question 3

pros of linear search

Answer 3

-good on small lists
-simple to code
-doesn’t need to be ordered

Question 4

cons of linear search

Answer 4

-takes a while on large lists
-has to go through entire list

Question 5

binary search

Answer 5

values in the list have to be ordered and compares the middle value to the data

Question 6

pros of binary search

Answer 6

-good on large lists
-doesn’t have many loops

Question 7

cons of binary search

Answer 7

-only works on ordered lists
-more complicated to code
-lists need reordering every time a new item is added

Question 8

what are the different sorting algorithms?

Answer 8

-bubble sort
-insertion sort
-merge sort

Question 9

bubble sort

Answer 9

goes through a list repeatedly, making comparisons between pairs of adjacent items and then swapping elements in the wrong order

Question 10

pros of bubble sort

Answer 10

-simple to write the code for
-simple to understand
-doesn’t need much memory

Question 11

cons of bubbles sort

Answer 11

-slowest way to sort a list

Question 12

insertion sort

Answer 12

each item is taken in turn, compared to the items in a sorted list and placed in the correct position

Question 13

pros of insertion sort

Answer 13

-simpler to code than merge sort
-useful for small lists
-faster than bubble sort

Question 14

cons of insertion sort

Answer 14

-not effective with large lists

Question 15

merge sort

Answer 15

splits large lists into individual lists by breaking them down, sorting them and then merging them back together in one large list

Question 16

pros of merge sort

Answer 16

-fastest sorting algorithm
-best option for long lists

Question 17

cons of merge sort

Answer 17

-more complicated to code
-may use twice the memory size of the list