# Tag Archives: Sorting Quiz

## Algorithms | Sorting | Question 5

Given an unsorted array. The array has this property that every element in array is at most k distance from its position in sorted array… Read More »

## Algorithms | Sorting | Question 4

Which of the following sorting algorithms in its typical implementation gives best performance when applied on an array which is sorted or almost sorted (maximum… Read More »

## Algorithms | Sorting | Question 3

Which of the following is not a stable sorting algorithm in its typical implementation. (A) Insertion Sort (B) Merge Sort (C) Quick Sort (D) Bubble… Read More »

## Algorithms | Sorting | Question 2

Suppose we have a O(n) time algorithm that finds median of an unsorted array. Now consider a QuickSort implementation where we first find median using… Read More »

## Algorithms | Sorting | Question 1

What is recurrence for worst case of QuickSort and what is the time complexity in Worst case? (A) Recurrence is T(n) = T(n-2) + O(n)… Read More »