Sorting algorithms I

What is meant by an in-place sorting algorithm?

• The input is already sorted and in-place

• It requires additional storage

• It needs O(1) memory to create auxiliary locations

• It requires additional space

Which of the following is an in-place sorting algorithm?

• Selection sort

• Insertion sort

• Bubble sort

• All

Which of the following sorting algorithms is best used when the array is nearly sorted to begin with?

• Selection sort

• Insertion sort

• Bubble sort

• None of the above

What is the worst case complexity of selection sort?

• O(nlogn)

• O(logn)

• O(n)

• O(𝐧𝟐)

Select the appropriate code that performs selection sort.

• 
• 
• 
• 

What is the average case complexity of selection sort?

• O(nlogn)

• O(logn)

• O(n)

• O(𝐧𝟐)

What is the disadvantage of selection sort?

• What is the disadvantage of selection sort?

• It is not scalable

• It can be used for small keys

• It takes linear time to sort the elements

How many passes does an insertion sorting algorithm consist of?

• N

• N-1

• N+1

• N2

What is the average case complexity of an insertion sort?

• O(nlogn)

• O(logn)

• O(n)

• O(𝐧𝟐)

Any algorithm that sorts by exchanging adjacent elements require O(N2) on average.

• True

• False