id/email
password
forgot password | create account
about | help | code help+videos | done | prefs
CodingBat code practice

 

zbaharav@kehillah.org 66-sortingprep > mergeSortBasic
prev  |  next  |  chance

Given two sorted input arrays of the same length, return an array which is the sorted combination of the two input arrays. The new array should be twice the length of the originals.


mergeSortBasic([1, 3], [2, 4]) → [1, 2, 3, 4]
mergeSortBasic([2, 5, 7], [3, 5, 6]) → [2, 3, 5, 5, 6, 7]
mergeSortBasic([1, 2, 3], [4, 5, 6]) → [1, 2, 3, 4, 5, 6]

...Save, Compile, Run (ctrl-enter)

public int[] mergeSortBasic(int[] a, int[] b) { }

Editor font size %:
Shorter output


Forget It! -- delete my code for this problem

Progress graphs:
 Your progress graph for this problem
 Random user progress graph for this problem
 Random Epic Progress Graph

Java Help

Misc Code Practice

Difficulty: 100

Copyright Nick Parlante 2017 - privacy