Sorting

Question 1

What two things are taken into consideration when determining the complexity of a sort?

Answer 1

1. ) traversals

2. )comparisons

Question 2

What two parts do the insertion and selection consist of?

Answer 2

unsorted & sorted

Question 3

What is the procedure for a selection sort?

Answer 3

• traverse to find the next value in the sorted part
• swap this value with the first unsorted value
• this new index is now the sorted part

Question 4

What is the procedure for an insertion sort?

Answer 4

• take first value in the unsorted
• traverse through the sorted and insert at that point
• mark that as sorted

Question 5

What is the worst time complexity of the insertion and selection sort?

Answer 5

O(N^2)

Question 6

What is the complexity of the merge sort?

Answer 6

O(N*log N)