public static int[] mergeArr ( int nums1[], int m, int nums2[], int n) { int i - 0,j int arr[] 0,k - 0; - new int[m+n]; //create a new array for merging while (i < m && j < n) { //if the current term in in first array is less than 2nd if ( nums1[i] <- nums2[j]) { arr[k++] - nums1[i++]; //add next term in nums1 to acc } else { arr[k++] - nums2[j++]; //add next term in nums2 to acc while (i < m ) { arr[k++] } while ( j
public static int[] mergeArr ( int nums1[], int m, int nums2[], int n) { int i - 0,j int arr[] 0,k - 0; - new int[m+n]; //create a new array for merging while (i < m && j < n) { //if the current term in in first array is less than 2nd if ( nums1[i] <- nums2[j]) { arr[k++] - nums1[i++]; //add next term in nums1 to acc } else { arr[k++] - nums2[j++]; //add next term in nums2 to acc while (i < m ) { arr[k++] } while ( j
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
100%
The code in the picture takes two sorted arrays of sizes m and n, then it merges and sorts them. Whats the best-case and worst-case for this alogrithm?
![260 /**
* This method handles joining and sorting two arrays
@param nums1
@param m
@param nums2 - 2nd array
@param n
@return
*/
public static int[] mergeArr ( int nums1[], int m, int nums2[], int n)
{
int i - 0,j = 0,k = 0;
int arr[]
27
28
first array
- size of first array
*
29
30
31
size of 2nd array
32
33
340
35
36
37
new int[m+n]; //create a new array for merging
%3!
38
while (i < m && j < n)
{
//if the current term in in first array is less than 2nd
if ( nums1[i] <= nums2[j])
{
arr[k++] = nums1[i++]; //add next term in nums1 to arr
}
else
39
40
41
42
43
44
45
46
47
{
48
49
arr[k++] = nums2[j++]; //add next term in nums2 to acr
}
}
while (i < m)
{
arr[k++]
}
while ( j<n)
{
arr[k++]
}
return arr;
} //end mergeArr
50
51
52
53
nums1[i++];
54
55
56
= nums2[j++];|
57
58
59
60
61 }
62](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F0cb17d95-e5df-4059-bfc5-c7da79fecf29%2Fd292bc4e-4ec3-4f8d-8414-7da22a31259c%2F2qaqlob_processed.png&w=3840&q=75)
Transcribed Image Text:260 /**
* This method handles joining and sorting two arrays
@param nums1
@param m
@param nums2 - 2nd array
@param n
@return
*/
public static int[] mergeArr ( int nums1[], int m, int nums2[], int n)
{
int i - 0,j = 0,k = 0;
int arr[]
27
28
first array
- size of first array
*
29
30
31
size of 2nd array
32
33
340
35
36
37
new int[m+n]; //create a new array for merging
%3!
38
while (i < m && j < n)
{
//if the current term in in first array is less than 2nd
if ( nums1[i] <= nums2[j])
{
arr[k++] = nums1[i++]; //add next term in nums1 to arr
}
else
39
40
41
42
43
44
45
46
47
{
48
49
arr[k++] = nums2[j++]; //add next term in nums2 to acr
}
}
while (i < m)
{
arr[k++]
}
while ( j<n)
{
arr[k++]
}
return arr;
} //end mergeArr
50
51
52
53
nums1[i++];
54
55
56
= nums2[j++];|
57
58
59
60
61 }
62
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education