Algorithms-Sorting-Quiz

20+ posts

Similar Topics

DSA

21k+ articles

Arrays

6.4k+ articles

Sorting

1.7k+ articles

Competitive Programming

1.5k+ articles

Algorithms

1.2k+ articles

DSA Quiz

300+ articles

cpp-vector

220+ articles

Sorting Quiz

70+ articles

Binary Search Trees

30+ articles

Algorithms-Greedy Algorithms

30+ articles

Algorithms | Sorting | Question 14

Last Updated: 11 June 2019

In a modified merge sort, the input array is splitted at a position one-third of the length(N) of the array. Which of the following is the tightest upper bound on time com ...read more

Sorting Quiz

DSA Quiz

Algorithms-Sorting-Quiz

Algorithms | Sorting | Question 13

Last Updated: 28 June 2021

The tightest lower bound on the number of comparisons, in the worst case, for comparison-based sorting is of the order of(A) N(B) N^2(C) NlogN(D) N(logN)^2 Answer: (C) Ex ...read more

Sorting Quiz

DSA Quiz

Algorithms-Sorting-Quiz

Algorithms | Sorting | Question 11

Last Updated: 28 June 2021

You have to sort 1 GB of data with only 100 MB of available main memory. Which sorting technique will be most appropriate?(A) Heap sort(B) Merge sort(C) Quick sort(D) Inse ...read more

Sorting Quiz

DSA Quiz

Algorithms-Sorting-Quiz

Algorithms | Sorting | Question 9

Last Updated: 22 December 2021

Suppose we are sorting an array of eight integers using heapsort, and we have just finished some heapify (either maxheapify or minheapify) operations. The arra ...read more

Sorting Quiz

DSA Quiz

Algorithms-Sorting-Quiz

Algorithms | Sorting | Question 23

Last Updated: 19 November 2018

Suppose we are sorting an array of eight integers using quicksort, and we have just finished the first partitioning with the array looking like this:2 5 1 7 9 12 11 ...read more

Sorting Quiz

DSA Quiz

Algorithms-Sorting-Quiz

Algorithms | Sorting | Question 7

Last Updated: 06 September 2021

Which of the following is not true about comparison-based sorting algorithms? (A)The minimum possible time complexity of a comparison-based sorting ...read more

Sorting Quiz

DSA Quiz

Algorithms-Sorting-Quiz

Algorithms | Sorting | Question 6

Last Updated: 28 June 2021

Consider a situation where swap operation is very costly. Which of the following sorting algorithms should be preferred so that the number of swap operations a ...read more

Sorting Quiz

DSA Quiz

Algorithms-Sorting-Quiz

Algorithms | Sorting | Question 5

Last Updated: 20 October 2021

Given an unsorted array. The array has this property that every element in the array is at most k distance from its position in a sorted array where k is a pos ...read more

Sorting Quiz

DSA Quiz

Algorithms-Sorting-Quiz

Algorithms | Sorting | Question 4

Last Updated: 28 June 2021

Which of the following sorting algorithms in its typical implementation gives best performance when applied on an array which is sorted or almost sorted (maxim ...read more

Sorting Quiz

DSA Quiz

Algorithms-Sorting-Quiz

Algorithms | Sorting | Question 3

Last Updated: 28 June 2021

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 Sort ...read more

Sorting Quiz

DSA Quiz

Algorithms-Sorting-Quiz

Algorithms | Sorting | Question 2

Last Updated: 28 June 2021

Suppose we have an O(n) time algorithm that finds the median of an unsorted array. Now consider a QuickSort implementation where we first find the median using ...read more

Sorting Quiz

DSA Quiz

Algorithms-Sorting-Quiz

Algorithms | Sorting | Question 1

Last Updated: 28 June 2021

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) and time complexity is O(n^2)(B) Recurr ...read more

Sorting Quiz

DSA Quiz

Algorithms-Sorting-Quiz

1 2 >>

Last

1 2 >>

Last

1 2 >>

Last