Sorting

Question 1

what are the 3 sorting algorithms?

Answer 1

bubble
insertion
merge

Question 2

what is bubble sort?

Answer 2

this sorting method is where the algorithm compares the 2 adjacent items in a list and swaps them accordingly. this process will continue and more passes will be done until there is a pass where no swaps are made

Question 3

what is insertion sort?

Answer 3

is a sorting algorithm that sorts by creating and inserting the next value into the correct place before moving on to the next value

Question 4

what is merge sort?

Answer 4

a sorting method where the list is divided into sublists containing one item each before comparing the individual sublists and joining them together until one large sorted list is created

Question 5

what are some benefits and negatives of bubble sort?

Answer 5

works well on small lists but is the slowest

Question 6

what are some benefits and negatives of insertion?

Answer 6

more efficient than bubble sort
slower than merge sort

Question 7

what are some benefits and negatives of merging sort?

Answer 7

fastest method
complicated to program