Register

Recent questions tagged merge-sort

0 votes
0 answers
31
mergesort
is mergesort inplace on linked list? it is not inplace on array
is mergesort inplace on linked list?it is not inplace on array
User Avatar
0 votes
1 answer
32
Algorithm
What is the right answer?
What is the right answer?
User Avatar
0 votes
0 answers
33
Merge Sort
Can anyone help me to understand this problem….??
Can anyone help me to understand this problem….??
User Avatar
2 votes
4 answers
34
MadeEasy Subject Test 2019: Algorithms - Sorting
Suppose there are 4 sorted list of 16 elements each. If we merge these lists into a single sorted list of 64 elements. The key comparisons that are needed in the worst case using an efficient algorithm are
Suppose there are 4 sorted list of 16 elements each. If we merge these lists into a single sorted list of 64 elements. The key comparisons that are needed in the worst ca...
User Avatar
0 votes
1 answer
35
Merge Sort
What mean by First Pass of algorithm and Second Pass of algorithm in a 2-way Merge Sort Algorithm ?
What mean by First Pass of algorithm and Second Pass of algorithm in a 2-way Merge Sort Algorithm ?
User Avatar
1 votes
2 answers
36
Adaptive sorting Algorithm.
Is Quick sort an adaptive sorting Algorithm? I think no. Because as per the definition given in the Wikipedia is that A adaptive sorting Algorithm is one who takes the advantage of preorderedness of the input. But in case of Quick sort it act as disadvantage.
Is Quick sort an adaptive sorting Algorithm? I think no. Because as per the definition given in the Wikipedia is that A adaptive sorting Algorithm is one who takes the ad...
User Avatar
0 votes
1 answer
37
Merge Sort
In the standard merge sort algorithm on a list of size n, what is the maximum number of times an item can be compared?
In the standard merge sort algorithm on a list of size n, what is the maximum number of times an item can be compared?
User Avatar
0 votes
1 answer
38
Merge Sort Inplace
no of comparisons in merge sort max? how many max no swaps??[if inplace algo]
no of comparisons in merge sort max?how many max no swaps??[if inplace algo]
User Avatar
0 votes
1 answer
39
merge sort
given n elements merge them into one sorted list using merge procedure then what is the time complexity for this ? explain with example
given n elements merge them into one sorted list using merge procedure then what is the time complexity for this ?explain with example
User Avatar
0 votes
0 answers
40
merge sort
what is the time complexity of merge sort for already sorted array explain with example?
what is the time complexity of merge sort for already sorted array explain with example?
User Avatar
3 votes
1 answer
41
Merge sort
How many swaps are performed in Merge sort algorithm in worst case?
How many swaps are performed in Merge sort algorithm in worst case?
User Avatar
0 votes
3 answers
42
Merge Sort Doubt
what is the recurrence relation for merge sort?
what is the recurrence relation for merge sort?
User Avatar
0 votes
1 answer
43
Doubt
can anyone explain in detail why and how is merge sort optimal for linked list?
can anyone explain in detail why and how is merge sort optimal for linked list?
User Avatar
0 votes
1 answer
44
ALGORITHMS
Is straight merge sort in gate syllabus?? If yes, where to study from?
Is straight merge sort in gate syllabus?? If yes, where to study from?
User Avatar
0 votes
1 answer
45
merge sort
n sorted subarrays each of size log n. find single sorted array with all elements.find time complexity
n sorted subarrays each of size log n. find single sorted array with all elements.find time complexity
User Avatar
0 votes
1 answer
46
Time complexity
User Avatar
4 votes
1 answer
47
Gateforum Test Series: Algorithms - Sorting
. In the standard merge sort algorithm on a list of size n, what is the maximum number of times an item can be compared? a)2 b)logn c)n-1 d)nlogn
. In the standard merge sort algorithm on a list of size n, what is the maximum number of times an item can be compared?a)2b)lognc)n-1d)nlogn
User Avatar
1 votes
1 answer
50
Ace volume-2 divide and conquer method
suppose merge sort takes 2 sec to sort a set of 64 keys then how much time will take to sort a set of 512 keys? here, ans is 24 sec how it is plz explain me.
suppose merge sort takes 2 sec to sort a set of 64 keys then how much time will take to sort a set of 512 keys?here, ans is 24 sec how it is plz explain me.
User Avatar
1 votes
1 answer
51
GeeksForGeeks analysis-of-algorithms Question 15
In a modified merge sort, the input array is split at a position one-third of the length(N) of the array. What is the worst case time complexity of this merge sort?
In a modified merge sort, the input array is split at a position one-third of the length(N) of the array. What is the worst case time complexity of this merge sort?
User Avatar
0 votes
3 answers
52
Merge Sort
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 computation is (A) (B) (C) (D)
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 computation is(A) (B) (C) (D)...
User Avatar
3 votes
2 answers
53
Merge Sort
The average no. of comparisons performed by the merge sort algorithm, in merging two sorted lists of length 2 is - a) 8/3 b) 8/5 c) 11/7 d) 11/6
The average no. of comparisons performed by the merge sort algorithm, in merging two sorted lists of length 2 is -a) 8/3b) 8/5c) 11/7d) 11/6
User Avatar
1 votes
2 answers
54
Ace Question 10
User Avatar
2 votes
1 answer
55
Merge sort
Given "log n" sorted lists each of size "n/log n",what is the total time required to merge them into one single list.
Given "log n" sorted lists each of size "n/log n",what is the total time required to merge them into one single list.
User Avatar
0 votes
0 answers
56
Sorting
You are asked to sort 15 randomly generated numbers. One should prefer - 1. Bubble Sort 2. Quick Sort 3. Merge Sort 4. Heap Sort Please explain why others 3 sorting algorithms except the answer can't be used ?
You are asked to sort 15 randomly generated numbers. One should prefer - 1. Bubble Sort2. Quick Sort3. Merge Sort4. Heap Sort Please explain why others 3 sorting algorith...
User Avatar
0 votes
1 answer
57
Made easy workbook
Assume that merge sort algorithm in the worst case takes 30 seconds for an input of size 64 which of The following most closely approximates the maximum input size of a problem that can be solved in 6 minutes
Assume that merge sort algorithm in the worst case takes 30 seconds for an input of size 64 which of The following most closely approximates the maximum input size of a p...
User Avatar
0 votes
1 answer
59
merge sort
Why do we say Merge sort makes good use of locality of reference? and if I have $1 \hspace{0.1cm} billion$ elements and my memory can only store $1 \hspace{0.1cm} million$ elements at a time. How would I use merge sort to sort this?
Why do we say Merge sort makes good use of locality of reference? and if I have $1 \hspace{0.1cm} billion$ elements and my memory can only store $1 \hspace{0.1cm} million...
User Avatar
1 votes
1 answer
60
IIIT Hyderabad Interview 2017
You have 1 billions elements, but memory which can hold only 1 million. How would you sort it using merge sort? Source-:https://gateoverflow.in/blog/4532/iiit-hyderabad-interview-experience-2017
You have 1 billions elements, but memory which can hold only 1 million. How would you sort it using merge sort?Source-:https://gateoverflow.in/blog/4532/iiit-hyderabad-in...
User Avatar
Page: