Register

Code for Merging for an array

606 views
0 0 votes
There are two arrays A and B having N/2 elements. The elements are stored in ascending  order already . Merge these arrays and create a new array C of size N . A code fragement is given. fill the missing part in it. the index variables have initial value as zero

if(...........)

C[] =.......... ;

else

C[]=...........;

2 Answers

Voting & Accepting an answer helps improve the community
← Previous · Code for stack pushNext → · the probability of t...
← Previous in category · Code for stack pushNext in category → · program
Position:
Show:

Related questions

0 0 votes
1 answers 1 answer
1.1k
1.1k views
dhruba asked May 29, 2023
1,064 views
Consider a divide and conquer algorithm that divides an input of size n into a subproblems, each of size n/b, and the cost of dividing and merging the problems is given by f(n) = Θ(n^c). The Master Theorem classifies this into different cases based on the value of c in relation to log_b(a). Could you explain the intuition and reasoning behind these classifications?
Consider a divide and conquer algorithm that divides an input of size n into a subproblems, each of size n/b, and the cost of dividing and merging the problems is given b...
9 9 votes
2 answers 2 answers
23.4k
23.4k views
radha gogia asked Jul 19, 2015
23,419 views
Given an unsorted array. The array has this property that every element in array is at most k distance from its position in sorted array where k is a positive integer smaller than size of array. Which sorting algorithm can be easily modified for sorting this array and what is the obtainable time complexity?
(A) Insertion Sort with time complexity O(kn)(B) Heap Sort with time complexity O(nLogk)(C) Quick Sort with time complexity O(kLogk)(D) Merge Sort with time complexity O(...
2 2 votes
4 4 answers
5.2k
5.2k views
GateAspirant999 asked Feb 2, 2017
5,181 views
Comparisons for merging four arrays
Suppose there are 4 sorted lists of 8 elements each. If we merge these lists into a single sorted list of 32 elements. The key comparisons that are needed in the worst ca...
2 2 votes
1 answers 1 answer
10.3k
10.3k views
sh!va asked Jul 9, 2016
10,337 views
Minimum number of comparisons for merging sorted files
Minimum number of comparisons for merging 4 sorted files containing 50, 10, 25 and 15 records will be : 100200175125