Getting/Printing the Highest to lowest

[micolord]

Printing the highest to lowest inputted numbers.

int house = {0,0,0,0,0},ctr;
Scanner Input = new Scanner(System.in);

for(ctr=0;ctr<=5;ctr++){
System.out.println("Enter a number: ");
house[1] = Input.nextInt();

System.out.println("Enter a number: ");
house[2] = Input.nextInt();

System.out.println("Enter a number: ");
house[3] = Input.nextInt();

System.out.println("Enter a number: ");
house[4] = Input.nextInt();
}

and now I only need to do is to arrange them and print them from highest to lowest, I've tried some if and else condition and I almost reached 80 lines using them and it didn't worked... My friend told me that there should be three loops, nested loops, loops with condition and a loop to continue on and I don't get it, I'm totally confused.

Out put should be like this:
5 - highest inputted number
4
3
2
1 - lowest inputted

[KevinWorkman]

How would you do this by hand, without a computer? Are you allowed to use the Collections class?

[micolord]

Yipee! Here what I've done so far:

import java.util.Arrays;
import java.util.*;
public class wew
{
public static void main(String [] args)
{
int[] muffin = new int[] {0,0,0,0,0};
int ctr;
Scanner Input = new Scanner(System.in);

for(ctr=0;ctr<5;ctr++){
if(ctr==0){
System.out.println("Enter a number: ");
muffin[0] = Input.nextInt();
}
if(ctr==1){
System.out.println("Enter a number: ");
muffin[1] = Input.nextInt();
}
if(ctr==2){
System.out.println("Enter a number: ");
muffin[2] = Input.nextInt();
}
if(ctr==3){
System.out.println("Enter a number: ");
muffin[3] = Input.nextInt();
}
if(ctr==4){
System.out.println("Enter a number: ");
muffin[4] = Input.nextInt();
}
}
Arrays.sort(muffin);
System.out.println(Arrays.toString(muffin));
}
}

The output will be, lowest to highest but I want is it to be highest to lowest, how do I do that???

[Norm]

I want is it to be highest to lowest, how do I do that?

You could write your own sort.

Look at your current code.
Do you see a pattern in the way the value of ctr and the index to the array are the same for all the if statements.
Try using the for loop variable for the index instead of hardcoding a numeric literal for the index.

What if you wanted to change the number of numbers to input?

[KevinWorkman]

Arrays contains a sort() method that also takes a Comparator as an argument. But somehow I think that using that method is defeating the purpose of your homework assignment.

[micolord]

your homework assignment.

Actually it isn't, I have failed to finish this during our hands and now doing it just for a little bit of fun and also to widen my knowledge.

Try using the for loop variable for the index instead of hardcoding a numeric literal for the index.

I don't get it ):

[Norm]

For example:

if(ctr==4){
    System.out.println("Enter a number: ");
    muffin[4] = Input.nextInt()

Here ctr and [4] have the same value.
[4] is a hardcoded numeric literal
Try replacing the hardcoded numeric literal with a variable:
muffin[ctr] = ...

[micolord]

For example:

if(ctr==4){
    System.out.println("Enter a number: ");
    muffin[4] = Input.nextInt()

Here ctr and [4] have the same value.
[4] is a hardcoded numeric literal
Try replacing the hardcoded numeric literal with a variable:
muffin[ctr] = ...

Thanks.

By the way, I'll have to add an another loop with some if statement??? and will have to remove this Arrays.sort(muffin);
System.out.println(Arrays.toString(muffin));??? I'm so confused XD

[micolord]

Any reply XDDDDD?

[Norm]

You will need to use a loop and a couple of indexes into your array.
Set one index to the first element in the array. Use the other index to go thru all the remaining elements.
Compare the value of the element at the first index to the element at the second index.
If the second element is greater than the first element, swap them.
Continue moving the second index to the last element in the array.
You now have the largest element in the array at the location the first index points to.
Advance the first index to the next slot in the array and do it again.
When you are at the end, the second largest element will be in the slot where the first index points.
Continue until there are no more elements to check.

[KevinWorkman]

Any reply XDDDDD?

Just a word to the wise- bumping your thread, especially after only a short time has gone by, actually hurts your chances of getting help. It makes you look impatient- there are thousands of posts here, each with its own urgent user, and their time is just as valuable as yours. It also makes it look like your thread has more replies, which many people will take to mean you've already received help, so they won't even read your post.

[micolord]

Just a word to the wise- bumping your thread, especially after only a short time has gone by, actually hurts your chances of getting help. It makes you look impatient- there are thousands of posts here, each with its own urgent user, and their time is just as valuable as yours. It also makes it look like your thread has more replies, which many people will take to mean you've already received help, so they won't even read your post.

Yes I'm badly sorry for being impatient, I'm just a little be tired that's all, sorry - again.

[micolord]

You will need to use a loop and a couple of indexes into your array.
Set one index to the first element in the array. Use the other index to go thru all the remaining elements.
Compare the value of the element at the first index to the element at the second index.
If the second element is greater than the first element, swap them.
Continue moving the second index to the last element in the array.
You now have the largest element in the array at the location the first index points to.
Advance the first index to the next slot in the array and do it again.
When you are at the end, the second largest element will be in the slot where the first index points.
Continue until there are no more elements to check.

Thank you so much.