This week's book giveaway is in the OO, Patterns, UML and Refactoring forum.
We're giving away four copies of Refactoring for Software Design Smells: Managing Technical Debt and have Girish Suryanarayana, Ganesh Samarthyam & Tushar Sharma on-line!
See this thread for details.
The moose likes C / C++ and the fly likes mergesort C program using recursion Big Moose Saloon
  Search | Java FAQ | Recent Topics | Flagged Topics | Hot Topics | Zero Replies
Register / Login


JavaRanch » Java Forums » Languages » C / C++
Bookmark "mergesort C program using recursion" Watch "mergesort C program using recursion" New topic
Author

mergesort C program using recursion

srinivas suri
Greenhorn

Joined: Nov 21, 2012
Posts: 4
/* I am not getting the output in a sorted order. Can someone help me where the bug is?? i guess it's somewhere in merge( ) .....but, i'm not able to figure it out..... THANKS a ton








srinivas suri
Greenhorn

Joined: Nov 21, 2012
Posts: 4
for(i=low;i<high;i++) //k will contain no.of elements in p
a[i]=p[i-low]; // //p[0] is copied to a[low] and so on..........
free(p);

i tried this one also....still, it doesn't work!
 
I’ve looked at a lot of different solutions, and in my humble opinion Aspose is the way to go. Here’s the link: http://aspose.com
 
subject: mergesort C program using recursion
 
It's not a secret anymore!