Do all the things like ++ or -- rants, post your own rants, comment on others' rants and build your customized dev avatarSign Up
Forgot to attach picture of the picture
asgs370316dThe lines 4 and 5 in that method adjust the appropriate indices and run recursively. "mid + 1" is the clue here
@asgs so that would mean the end parameter is inclusive. Otherwise it would be skipping mid?
Now I see the for (int i=0; i< (mid-low+1);i++)
What's looking for a <= so basically this would mean the Left side will always have the 1 more item than the right if and odd succeed array is the input?
Guess is the "indexes start at 0" thing that makes it tricky...
Your Job Suck?
Take a quick quiz from Triplebyte to skip the job search hassles and jump to final interviews at hot tech firms
Get a Better Job