Sorting algorithm - vector of int - C

Question

0.00/5 (No votes)

See more:

Good Evening

I have a vector of int that I need to sort in ascending order and I am looking for the most optimized algorithm to do it.
For my case I guess quicksort is the most recommended one, but anyway I would like to check if that's right.

I have 6 cases that I want to test:
* 10 milion elements array generated randomly
* 100 milion elements array generated randomly
* 10 milion elements array already sorted
* 100 milion elements array already sorted
* 10 milion elements array sorted in descending order
* 100 milion elements array sorted in descending order

I saw people recommending to use some algorithm until I reach certain point e then use another for improving optimization.
For my case should I change the algorithm depending on the array size or it isn't necessary? Is there any other way that can improve those tests?

Posted 1-Oct-15 15:29pm

Member 11779222

Add a Solution

Comments

Philippe Mori 1-Oct-15 23:09pm

Why not try it? By the way, if predefined algorithm is enough, just use it. As long as the algorithm is O(n log n), you should have adequat performance in you case.

3 solutions

Solution 1

Looks like home work to me.

Why not add time measure to your code, implement different algorithms and measure the outcome for the different cases.
That should give you the answer which method is most efficient for each case (or maybe for all).

Posted 1-Oct-15 17:01pm

George Jonsson

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

phil.o · Accepted Answer · 2015-10-01T20:09:00

Solution 2

If only CodeProject had one of the best articles on the subject[^].

Posted 1-Oct-15 20:09pm

phil.o

CPallini · Accepted Answer · 2015-10-01T20:59:00

Solution 3

You know the major sorting algorithms have been studied and their performance is known (I would reccomend the oldie-goldie Wirth's book[^] as starting point).

If you are really curious to measure the performance on your set of data then no one prevents you in doing that.

Posted 1-Oct-15 20:59pm

CPallini

v2