Test my Merit My Results Create Exam

Higher Study | Algorithms | Searching

which of the following is not a stable sorting algorithm in its typical implementation?
What is the best case complexity of QuickSort?
Algorithm design technique used in quicksort algorithm is?
Consider a complete binary tree where the left and the right subtrees of the root are max-heaps. The lower bound for the number of operations to convert the tree to a heap is
The usual O(n2) implementation of insertion sort to sort an array uses linear search to identify the position where an element is to be inserted into the already sorted part of the array. If, instead, we use binary search to identify the position, the worst case running time will
Randomized quicksort is an extension of quicksort where the pivot is chosen randomly. What is the worst case complexity of sorting n number using randomized quicksort?
The given array is arr = {1, 2, 4, 3}. Bubble sort is used to sort the array elements. How many passes will be done to sort the array?
Suppose we are given n keys, m hash table slots, and two simple uniform hash functions h1 and h2. Further, suppose our hashing scheme uses h1 for the odd keys and h2 for the even keys. What is the expected number of keys in a slot? 
Let H be a primary min-heap consisting of n elements implemented as an array. What is the worst case time complexity of an optimal algorithm to find the maximum element in H?
What is the worst-case number of arithmetic operations performed by recursive binary search on a sorted array of size n?
What is the best case time complexity of radix sort algorithm?
Given a binary-max heap. The elements are stored in an arrays as 25, 14, 16, 13, 10, 8, 12.What is the content of the array after two delete operations?
What is the worst-case time complexity of the Quick Sort algorithm to sort a list of ‘n’ values?
Consider a hash table of size 7, with hash function H (k) = k % 7, and pseudo random i = (i + 5) % 7. We want to insert the following keys one by one from left to right. 15, 11, 25, 16, 9, 8, 12 What will be the position of the key 25, if we use random probing?
What is mean by stable sorting algorithm?
Ads