Search:

Thanx all members for your help; finally got the program working and gained knowledge about buffer overrun... :D
Special thanx to Andreas and iMalc...

Regards
Ashu

A way-out for this is to convert your integer to array or string and then compare its elements ( directly if array or on basis of ASCII value if string)
Though there may be some better way-out...

Though the output in my system still shows 10,20 but i understand there is a possibility of bug... But why did mergesort function wont work even in first run then???

Thanks for your concern over...

Sorry for the poor english. It often happens with me while i am posting cause that time my concern is not on language....
And whole source code from book; yeah over exaggerated... i meant about...

Isnt (*n)++ for the same??
Besides, I have just pointed out the mistake in line 122 ( line 8 in insertsorted function), its actually k-- instead of a--. it was minor print mistake...
Now insertsort...

I am using Data Structure using C by RS Salaria.... Dont know how good it is... But i would like to mention his book only provide source code of function.. Main is written by me cause we were asked...

With GCC compiler, its quite possible, i believe.....
Goto is just to rerun the program in case of wrong entry. i might use loops for that.... But that would work only when complete program...

Code is from book was referenced to function which is created; main is written by me and that is too obvious, cause no book will provide whole source code all the functioning in one program....

checkcounter returns -1, on entering array with even numbers 2nd time.... Be it merge sorted array or re running program via y character when prompted...

I have been asked to make an array program which includes merging, sorting, averaging inserting, deleting arrays etc....
While almost all the program has been made, i find few bugs giving false...