Recent questions tagged sorting

0 votes

0 answers 4 views

Made easy Test Series question....
Consider th following cases for quick sort to sort an array of n element $a[0...n-1]$ i) Choosing the pivot element randomly from the given array ii) choosing median element as pivot. Iii) Choosing middle element as pivot For which of the above cases quick sort always gives $O(nlogn)$ time complexity?

Consider th following cases for quick sort to sort an array of n element $a[0...n-1]$ i) Choosing the pivot element randomly from the given array ii) choosing median element as pivot. Iii) Choosing middle element as pivot For which of the above cases quick sort always gives $O(nlogn)$ time complexity?

asked Sep 11 in Algorithms `JEET 144 points 4 views

0 votes

0 answers 2 views

Made Easy online test series
Consider an array A of length n, array contain number between (1 – 10), in any arbitary order, best sorting algorithm takes $650$ ns if $n = 50$, the time required by algorithm if n = 300.

Consider an array A of length n, array contain number between (1 – 10), in any arbitary order, best sorting algorithm takes $650$ ns if $n = 50$, the time required by algorithm if n = 300.

asked Sep 11 in Algorithms `JEET 144 points 2 views

1 vote

1 answer 14 views

Gatebook TS: Algorithms
An array is said to be -ordered if for each such that . for example, the array 1 4 2 6 3 7 5 8 is 2-ordered. In a 2-ordered array of 2N elements, what is the maximum number of positions that an element can be from its position if the array were 1-ordered?

An array is said to be -ordered if for each such that . for example, the array 1 4 2 6 3 7 5 8 is 2-ordered. In a 2-ordered array of 2N elements, what is the maximum number of positions that an element can be from its position if the array were 1-ordered?

asked Sep 1 in Algorithms Sambhrant Maurya 204 points 14 views

0 votes

0 answers 8 views

Gatebook test series
Below is the implementation of merge sort. void sort(int a, int lo, int hi){ if(hi<=lo) return; int mid = lo + (hi-lo)/2; sort(a,lo,mid); sort(a,mid+1,hi); merge(a,lo,mid,hi); } Assume that merge function merges the elements a[lo] to a[mid] and a[mid+ ... a[mid]<=a[mid+1]. The number of comparisons needed to merge sort a sorted array is: O(n log n) O(n) O(1) O(log n)

Below is the implementation of merge sort. void sort(int a, int lo, int hi){ if(hi<=lo) return; int mid = lo + (hi-lo)/2; sort(a,lo,mid); sort(a,mid+1,hi); merge(a,lo,mid,hi); } Assume that merge function merges the elements a[lo] to a[mid] and a[mid+1] to a[hi]. ... merge() whenever a[mid]<=a[mid+1]. The number of comparisons needed to merge sort a sorted array is: O(n log n) O(n) O(1) O(log n)

asked Sep 1 in Algorithms Sambhrant Maurya 204 points 8 views

0 votes

2 answers 26 views

what does tightest lower bound means??
Here the tightest lower bound means?. (Please suggest some source if possible for such questions) https://gateoverflow.in/1026/gate2004-29

Here the tightest lower bound means?. (Please suggest some source if possible for such questions) https://gateoverflow.in/1026/gate2004-29

asked Aug 26 in Algorithms Rishav_Bhatt 8 points 26 views

0 votes

0 answers 5 views

Topological sort
The time complexity of Topological sort is O(V+E) if we use the adjacency list(linked list representation). What will be time complexity when we use the adjacency matrix? Explain.

The time complexity of Topological sort is O(V+E) if we use the adjacency list(linked list representation). What will be time complexity when we use the adjacency matrix? Explain.

asked Jul 1 in Algorithms shubhamscifi 6 points 5 views

0 votes

1 answer 11 views

sorting merge sort
Is there overlapping of subproblem in merge sort? Can we solve merge sort using dynamic programming? please give some explanation.

Is there overlapping of subproblem in merge sort? Can we solve merge sort using dynamic programming? please give some explanation.

asked Jun 25 in Algorithms Shubhm 20 points 11 views

0 votes

1 answer 23 views

https://www.examveda.com/
________ is the sorting technique in which if we put an element in the appropriate place in a sorted list it should yield a larger sorted order list. A. insertion B. distribution C. selection D. extraction Answer: Option A please provide some explanation, i m not able to understand the question

________ is the sorting technique in which if we put an element in the appropriate place in a sorted list it should yield a larger sorted order list. A. insertion B. distribution C. selection D. extraction Answer: Option A please provide some explanation, i m not able to understand the question

asked Jun 20 in Algorithms Shubhm 20 points 23 views

Log In

Register

Recent questions tagged sorting