Dark Mode

Recent questions tagged merge-sort

1 vote

1 answer

61

ISRO2018-35
Given two sorted list of size $m$ and $n$ respectively. The number of comparisons needed the worst case by the merge sort algorithm will be: $m \times n$ maximum of $m$ and $n$ minimum of $m$ and $n$ $m+n-1$

Arjun asked in Algorithms Apr 22, 2018

by Arjun

2.4k views

1 vote

1 answer

62

Merge sort algorithm
Consider the modified merge sort where we divide array into 5 equal sub arrays instead if 2(as in standard merge sort).What is the time complexity if modified merge sort? Is there any improvement over standard merge sort?

rahul sharma 5 asked in Algorithms Mar 9, 2018

by rahul sharma 5

1.3k views

2 votes

2 answers

63

Merge Sort
Let A,B,C,D,E are sorted sequences having length 70,74,80,85,102 respectively.They are merged into a single sequence by merging together two sequences at a time.The minimum number of comparisons that will be needed by algorithm in best case for going merging is _________.

VS asked in Algorithms Jan 30, 2018

by VS

4.3k views

1 vote

0 answers

64

Rahul_Rathod_ asked in Algorithms Jan 26, 2018

by Rahul_Rathod_

495 views

3 votes

0 answers

65

MultiSubject (CO, DIgital, DS)
A 4-bit modulo-16 ripple counter uses JK flip-flops. If the propagation delay of each FF is 100 ns, the maximum clock frequency that can be used is equal to: Ans 2.5MHz. I think it should be $\frac{1}{16*10^{-7}} = 0.625MHz$ ... minimum number of comparisons that will be needed in the worst case by the optimal algorithm for doing this is Ans = 840 I am getting 860.

Shubhanshu asked in Programming in C Jan 25, 2018

1.7k views

1 vote

0 answers

66

Merge sort and insertion sort

Parshu gate asked in Algorithms Nov 20, 2017

847 views

3 votes

1 answer

67

merge sort
Merge sort using linked list is better than array in terms of space complexity true or not with explanation :)

A_i_$_h asked in Algorithms Nov 14, 2017

742 views

0 votes

0 answers

68

MERGE SORT
IS 2 way merge sort and normal merge sort is same.in which we have to use bottom-up merging approach by taking 2-2 element inside the list.if 5-way merge sort then in the list we have to take 5-5 elements from bottom to up for merging. if I am wrong please let me correct!

learner_geek asked in Algorithms Oct 28, 2017

by learner_geek

590 views

4 votes

1 answer

69

Merge sort
True or False Merge sort on Linked list takes O(nlogn)

Shivi rao asked in DS Oct 10, 2017

1.5k views

4 votes

4 answers

70

Ace Test Series: Algorithms - Sorting
Consider bottom-up merge sort working on 'n' elements. Assume 'n' is a power of 2. The minimum number of comparisons in order to get sorted list is (A) (n log n) / 2 (B) n lon n - n + 1 (C) n log n (D) n log n + n

Aibi asked in Algorithms Oct 8, 2017

by Aibi

2.6k views

0 votes

1 answer

71

Merge Sort
The best case time complexity to merge two sorted file of size m and n is A. O(m) B. O(n) C. O(MIN{m,n}) D. O(m+n)

mystylecse asked in Algorithms Oct 4, 2017

554 views

1 vote

1 answer

72

Merge sort vs heap sort
Which of the following algorithm gives best performance when items are in reverse order ? a) Merge sort. b) Heap sort.

Xylene asked in Algorithms Aug 16, 2017

by Xylene

2.0k views

2 votes

2 answers

73

merge sort no. of levels when input is n ??
HOW NO. OF LEVELS IS LOG N + 1 CAN ANYONE HELP ME , how to solve this and get log n + 1

sumit goyal 1 asked in Algorithms Aug 9, 2017

by sumit goyal 1

725 views

1 vote

1 answer

74

algorithm
Consider bottom- up merge sort working on 'n' elements . Assume n is a power of 2. The minimum number of comparisons in order to get sorted list is a) n log n/2 b)n log n-n+1 c)n logn d)n logn +n

A_i_$_h asked in Algorithms Jul 24, 2017

1.7k views

1 vote

1 answer

75

merge sort
Assume 5 buffer pages are available to sort a file of 105 pages. The cost of sorting using m-way merge sort is

patilnivedita asked in DS Jun 25, 2017

by patilnivedita

555 views

6 votes

3 answers

76

Merge Sort Comparisons
Q . 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)NOT My doubt is here ,Are we considering a specific Item throughout our Analysis.?

imamitk9 asked in Algorithms Jun 20, 2017

3.3k views

1 vote

2 answers

77

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)

Bhavana Giri 10 asked in Algorithms Jun 14, 2017

by Bhavana Giri 10

7.0k views

1 vote

3 answers

78

Self doubt
You are asked to sort 15 randomly generated numbers. One should prefer— (a) Bubble sort (b) Quick sort (c) Merge sort (d) Heap sort I think the answer should be c or d crct me???

Shubhanshu asked in Algorithms Jun 6, 2017

1.6k views

0 votes

1 answer

79

Doubt
CAn anyone explian about 2-way merge sort ? (You can take example from GATE1999-1.14, ISRO2015-42)

Angkit asked in Algorithms May 14, 2017

by Angkit

327 views

0 votes

0 answers

80

MargeSort Algorithm Implementation
#include<stdio.h> void mergeArray(int arr[],int l,int m,int r) { int n1=m-l+1; int n2=r-m; int Larr[n1]; int Rarr[n2]; int i,j,k; for(i=0;i<n1;i++) Larr[i]=arr[l+i]; for(j=0;j<n2;j++) Rarr[j]=arr[m+1+j]; i=0; j=0; ... 0; } In this code when i am giving the input n=5; 2 3 1 4 5 than it will give 1 2 3 1 2 where is the problem can anyone explain ?

Nitesh Choudhary asked in Programming in C Apr 29, 2017

by Nitesh Choudhary

360 views

1 vote

3 answers

81

Made Easy test series
"A" sort a particular dataset of size n using merge sort in 640 msec, "B" uses the same algorithm on dataset of size 16, it takes 256 msec to sort them. what is size of data set used by "A" A. 32 B. 64 C. 128 D. None of above

shreyansh jain asked in Algorithms Apr 24, 2017

by shreyansh jain

768 views

0 votes

2 answers

82

Arnabi asked in Algorithms Jan 28, 2017

by Arnabi

623 views

0 votes

4 answers

83

harshit agarwal asked in Programming in C Jan 15, 2017

by harshit agarwal

1.2k views

0 votes

1 answer

84

Recursive call count for merge sort

Anirban Biswas asked in Algorithms Jan 10, 2017

by Anirban Biswas

1.5k views

0 votes

2 answers

85

doubt
In an effort to make MERGE-SORT faster, you decide to divide the array into k equal sized, disjoint subarrays, where k > 2. This means that you have to merge k lists. How many levels are present for this algorithm assuming merge can be accomplished in O(n log(k)) time. O(log2 k) O(n) O(logkn) O(lognk)

Arnabi asked in Algorithms Jan 6, 2017

by Arnabi

358 views

3 votes

3 answers

86

Merge Sort
Consider the following statement: S1: Merge sort on linked list take O(n log n) time to sort input of length n. S2: Merge sort on linked list give better space complexity then on array. S3: Inplace merge sort on array will take O(n2) time. Which of the following is correct? a)S1 b)S1 and S2 c)S1,S2,S3 d) None

srestha asked in DS Jan 4, 2017

3.7k views

4 votes

1 answer

87

no of comparisons
What are the number of comparisons in merge sort? m+n or m+n-1...

vaishali jhalani asked in Algorithms Dec 13, 2016

by vaishali jhalani

14.3k views

1 vote

1 answer

88

Algorithms [2 way merge]
Is 2 way merge behaves same as we do in merge sort?Dividing into groups of two from top to bottom or does it start from bottom to top by mergeing two elements at a time.?Please share example for understanding

rahul sharma 5 asked in Algorithms Dec 10, 2016

by rahul sharma 5

1.1k views

0 votes

0 answers

89

Merge Sort - Miximum Input Size
Assume that a merge sort algorithm in worst case takes30s for an input of size 64. Which of the following closely approximate maximum input size of a problem that can be solved in 6min. 128 256 512 1024

pC asked in Algorithms Dec 8, 2016

by pC

626 views

2 votes

1 answer

90

Calculate the cost of sorting using m-way merge sort :
Assume 5 buffer pages are available to sort a file of 105 pages. The cost of sorting using m-way merge sort is A. 206 B. 618 C. 840 D. 926

sh!va asked in Algorithms Nov 10, 2016

by sh!va

6.6k views

Page:

Recent questions tagged merge-sort