Timeline for Merge Sort running into infinite loop using recursion
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 30, 2016 at 7:32 | comment | added | aquablitz11 |
Okay, I added an explanation on that part. That should also explain possible segmentation fault. And, it seems like you forgot to change your last for loop condition in merge(). It should be i <= end.
|
|
| Mar 30, 2016 at 7:30 | history | edited | aquablitz11 | CC BY-SA 3.0 |
Explain `j` value problem
|
| Mar 29, 2016 at 21:23 | comment | added | Ujjwal Arora | Thank You @AquaBlitz11,I have made the necessary changes in the code,i am afraid i am still hazy on our explanation on variable "j". "Furthermore, please check your j value carefully. For example, if you have beg at 0, end at 1 and mid at 0, your i and j will be the same and your loops are prone to copying same value twice.". Could you please explain the same in a little detail? I have also modified my code to incorporate the logic pitfalls but my program is crashing,could you please take a look? | |
| Mar 28, 2016 at 23:26 | history | answered | aquablitz11 | CC BY-SA 3.0 |