lowest value of sort

Question

0.00/5 (No votes)

See more:

How to find a lowest value of sort?
I have an array of integers and I need to sort it low->high.
I need to know the lowest count of swapped number values, i.e :

I have 7469 -> 4697 - Lowest value is 7, as 4+6+9 is more.

7123 would be 6, as 1+2+3 < 7.

What is the algorithm?

Posted 4-Apr-12 7:13am

vincaslt

Add a Solution

Comments

JackDingler 4-Apr-12 13:26pm

It looks like you more or less explained the algorithm.

LV = a < (b + c + d) ? a : (b + c + d);

YvesDaoust 23-Apr-12 10:03am

I don't believe one can easily make sense of this problem statement.

You use the term "count" (usually meaning number of), but you compare sums (adding the values together).

And what do you call "swapped numbers" ? All of the numbers are moved during the sorts.

1 solution

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)

barneyman · Answer 1 · 2012-04-04T13:10:00

Solution 1

looks like you want the Bubble Sort[^]

Posted 4-Apr-12 13:10pm

barneyman