When to use each Sorting Algorithm
A sorting algorithm is an algorithm that makes arrange in a certain order. The fundamental task is to put the items in the desired order… Read More »
A sorting algorithm is an algorithm that makes arrange in a certain order. The fundamental task is to put the items in the desired order… Read More »
Given an array of integers. The task is to sort the given array on the basis increasing count of distinct prime factors. Examples: Input :… Read More »
Given an integer array , the task is to sort only the elements which are perfect squares at their relative positions in the array (positions… Read More »
Given two arrays of size N, and two numbers X and Y, the task is to maximize the sum by considering the below points: Pick… Read More »
Given a BST, the task is to find the sum of all elements greater than or equal to K-th largest element in O(1) space. Examples:… Read More »
Given an array where numbers are in range from 1 to n6, which sorting algorithm can be used to sort these number in linear time?… Read More »
Which of the following is true about merge sort? (A) Merge Sort works better than quick sort if data is accessed from slow sequential memory.… Read More »
The number of elements that can be sorted in time using heap sort is (A) (B) (C) (d) (A) A (B) B (C) C (D)… Read More »
Which sorting algorithms is most efficient to sort string consisting of ASCII characters? (A) Quick sort (B) Heap sort (C) Merge sort (D) Counting sort… Read More »
Which of the following sorting algorithms has the lowest worst-case complexity? (A) Merge Sort (B) Bubble Sort (C) Quick Sort (D) Selection Sort Answer: (A)… Read More »
Consider the Quicksort algorithm. Suppose there is a procedure for finding a pivot element which splits the list into two sub-lists each of which contains… Read More »
In quick sort, for sorting n elements, the (n/4)th smallest element is selected as pivot using an O(n) time algorithm. What is the worst case… Read More »
A list of n string, each of length n, is sorted into lexicographic order using the merge-sort algorithm. The worst case running time of this… Read More »
Which sorting algorithm will take least time when all elements of input array are identical? Consider typical implementations of sorting algorithms. (A) Insertion Sort (B)… Read More »
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… Read More »