Please someone should help me explain how line 29-32 works. I don't understand how the recursive call is working

Hello
The arrow function mergesort is useless in the code ,except if it's being called in another line which isn't showing in the posted screenshot.

A recursive function calls itself until it can't i.e if the condition set is true for all values ,the algorithm for the recursive function act like a while loop and runs till your CPU got f*cked up,meaning that it'll run indefinitely.

Even the arrow function mergesort won't even do something close to what it names implies, it's sorting and merging nothing at all but slicing it which won't show in the output

Lol merge sort nothing forever

Here's a reference to save you:
https://www.w3resource.com/javascript-exercises/searching-and-sorting-algorithm/searching-and-sorting-algorithm-exercise-2.php

Hey am a learner like you but take this might help you. Cheers. Continue with the second
Function under the first function to complete the code

IhateRetards:
Hey am a learner like you but take this might help you. Cheers. Continue with the second
Function under the first function to complete the code

Please is this normal JavaScript or DSAs

Laryfrosh:


Please is this normal JavaScript or DSAs

Yeah JavaScript DSA

IhateRetards:
Hey am a learner like you but take this might help you. Cheers. Continue with the second
Function under the first function to complete the code

What book is this pls?

IhateRetards:


Yeah JavaScript DSA

I for sey o

[quote author=IhateRetards post=112680486][/quote]
Thanks

[quote author=IhateRetards post=112680486][/quote]

Please do you have the PDF for this