Register

Search results for sorting

0 votes
2 answers
41
Binary search is performed on a sorted array of n elements. The search key is not in the array and falls between the elements at positions m and m+1 (where 1 ≤ m < n). How many comparisons are needed in the worst case scenario to determine that the key is not in the array?
Binary search is performed on a sorted array of n elements. The search key is not in the array and falls between the elements at positions m and m+1 (where 1 ≤ m < n). ...
User Avatar
1 votes
2 answers
42
geeksforgeeks
In a modified merge sort, the input array is splitted at a position one-third of the length(N) of the array. What is the worst case time complexity of this merge sort? A N(logN base 3) B N(logN base 2/3) C N(logN base 1/3) D N(logN base 3/2)
In a modified merge sort, the input array is splitted at a position one-third of the length(N) of the array. What is the worst case time complexity of this merge sort?AN(...
User Avatar
0 votes
1 answer
44
Combinatorics, Discrete Maths (self doubts)
Consider the set of 4 -digit positive integers. How many of them have their digits in :- a) strictly decreasing order ? b) non decreasing order ? c) non increasing order ?
Consider the set of 4 -digit positive integers. How many of them have their digits in :-a) strictly decreasing order ?b) non decreasing order ?c) non increasing order ?...
User Avatar
5 votes
5 answers
45
ISRO2020-33
If an array $A$ contains the items $10,4,7,23,67,12$ and $5$ in that order, what will be the resultant array $A$ after third pass of insertion sort? $67,12,10,5,4,7,23$ $4,7,10,23,67,12,5$ $4,5,7,67,10,12,23$ $10,7,4,67,23,12,5$
If an array $A$ contains the items $10,4,7,23,67,12$ and $5$ in that order, what will be the resultant array $A$ after third pass of insertion sort?$67,12,10,5,4,7,23$$4,...
User Avatar
0 votes
0 answers
51
Algorithm
User Avatar
4 votes
11 answers
52
NIELIT 2016 MAR Scientist B - Section C: 12
Which of the following sorting algorithms does not have a worst case running time of $O(n​^2​)$? Insertion sort. Merge sort. Quick sort. Bubble sort.
Which of the following sorting algorithms does not have a worst case running time of $O(n​^2​)$?Insertion sort.Merge sort.Quick sort.Bubble sort.
User Avatar
23 votes
3 answers
56
GATE CSE 1992 | Question: 03,iv
Assume that the last element of the set is used as partition element in Quicksort. If $n$ distinct elements from the set $\left[1\dots n\right]$ are to be sorted, give an input for which Quicksort takes maximum time.
Assume that the last element of the set is used as partition element in Quicksort. If $n$ distinct elements from the set $\left[1\dots n\right]$ are to be sorted, give an...
User Avatar
3 votes
3 answers
59
number of comparison require in RADIX sort
I am not able to get this formula (number of input * number of digit *base of number ) I am not getting how base of number is important ? Thanks :)
I am not able to get this formula (number of input * number of digit *base of number )I am not getting how base of number is important ?Thanks :)
User Avatar
0 votes
0 answers
60
I have a algorithm and i want to prove with induction, need help!
Hello, i have a algorithm and i want to prove it with induction how can i do that ? Also i want to worst case run time analyze but i am not very good please help me please. Thank you so much!
Hello, i have a algorithm and i want to prove it with induction how can i do that ?Also i want to worst case run time analyze but i am not very good please help me please...
User Avatar
Page: