ProgrammingThis forum is for all programming questions.
The question does not have to be directly related to Linux and any language is fair game.
Notices
Welcome to LinuxQuestions.org, a friendly and active Linux Community.
You are currently viewing LQ as a guest. By joining our community you will have the ability to post topics, receive our newsletter, use the advanced search, subscribe to threads and access many other special features. Registration is quick, simple and absolutely free. Join our community today!
Note that registered members see fewer ads, and ContentLink is completely disabled once you log in.
If you have any problems with the registration process or your account login, please contact us. If you need to reset your password, click here.
Having a problem logging in? Please visit this page to clear all LQ-related cookies.
Get a virtual cloud desktop with the Linux distro that you want in less than five minutes with Shells! With over 10 pre-installed distros to choose from, the worry-free installation life is here! Whether you are a digital nomad or just looking for flexibility, Shells can put your Linux machine on the device that you want to use.
Exclusive for LQ members, get up to 45% off per month. Click here for more info.
You supply a function that compares two elements of the array, and qsort uses it as a callback, repeatedly, until the array is sorted. Your comparison function can compare on what ever basis you wish.
Is stable_sort only C++? If you are sorting without regard to case (as in "Adam" is the same as "adam"), stable_sort will keep them in the same order in relationship to each other. This means that if you have both "Adam" and "adam" in the same list, if "Adam" occurs before "adam" in the original list, it will still be before "adam" in the sorted list. I know for sure that qsort does not guarantee that they will stay in the same order, but I'm not sure the equivalent to stable_sort in C.
ta0kira
LinuxQuestions.org is looking for people interested in writing
Editorials, Articles, Reviews, and more. If you'd like to contribute
content, let us know.