I need to use a sorting algorithm in a list that has as much as 500,000 elements. This program runs on an embedded PC. Does anyone knows which sorting algorithm has the best performance in time complexity as well as in memory?
Share
Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
I need to use a sorting algorithm in a list that has as much as 500,000 elements. This program runs on an embedded PC. Does anyone knows which sorting algorithm has the best performance in time complexity as well as in memory?
If the values of the items are not very large (8-bit or even 16), you should try one Integer Sort, like Counting sort or other
http://en.wikipedia.org/wiki/Counting_sort