Sort int[] array big to small

Question

I want to sort the numbers so that the output is: [12,9,8,7,5,4,3,1] Please help ;)

int[] array = new int[]{8,5,3,7,9,12,4,1};
int biggest = 0;
for (int i =0; i<array.length;i++){
    if(array[i]>biggest){
        biggest = array[i];
    }
}
System.out.println(biggest); //Outputs 12

binary search method, but of course the array has to be sorted first? — Ousmane D., Mar 06 '17 at 21:52
Please edit the question and/or title, it is vague and confusing — Gab, Mar 06 '17 at 21:58
Possible duplicate of "[Java Array Sort descending?](https://stackoverflow.com/questions/1694751/java-array-sort-descending)". — Kevin J. Chase, Mar 06 '17 at 22:29

ΦXocę 웃 Пepeúpa ツ · Answer 1 · 2017-03-06T21:54:02.433

2

Use streams in java 8:

int[] array = new int[]{8,5,3,7,9,12,4,1};
int max = Arrays.stream(array).max().getAsInt();

edited Mar 06 '17 at 21:54

answered Mar 06 '17 at 21:52

ΦXocę 웃 Пepeúpa ツ

47,427
17
69
97

Only prints out 12 instead of the whole row – luukcollin Mar 06 '17 at 21:54
3

@luukcollin your questions says "Shortest way to find the biggest integer in a row in a list[JAVA]" hence he has provided that algorithm for you – Ousmane D. Mar 06 '17 at 21:56

iMysak · Accepted Answer · 2017-03-06T22:04:38.257

1

Try this:

    int[] array = new int[]{8,5,3,7,9,12,4,1};
    Arrays.sort(array);
    for (int i =array.length -1; i>=0;i--){
      System.out.println(array[i]);
    }

And with streams:

int[] array = new int[]{8,5,3,7,9,12,4,1};
Arrays.stream(array).boxed()
    .sorted(Comparator.reverseOrder()).forEach(System.out::println);

edited Mar 06 '17 at 22:04

answered Mar 06 '17 at 21:54

iMysak

2,170
1
22
35

1

does this algorithm answer the authors questions of "Shortest way to find the biggest integer in a row in a list[JAVA]"...... ? – Ousmane D. Mar 06 '17 at 21:55
This works, but idk if this is the shortes but thanks m8 – luukcollin Mar 06 '17 at 21:56
@Os. I this this is exactly what he wants, by described output example. But yes, the question is a bit... confusing? – iMysak Mar 06 '17 at 21:57
@iMysak alright, as long as the author is happy, then all good. ;) – Ousmane D. Mar 06 '17 at 21:58

Cardinal System · Answer 3 · 2017-03-07T00:51:13.213

Use the bubble sort to organize the array:

int a, b, t;
int size = array.length;

for(a=1; a < size; a++)
    for(b=size-1; b >= a; b--){
        if(array[b-1] > array[b]){ //If out of order
           t = array[b-1];
           array[b-1] = array[b];
           array[b] = t;
          }
   }

then reverse the order so it's highest to lowest:

  for(int i = 0; i < array.length / 2; i++)
    {
        int temp = array[i];
        array[i] = array[array.length - i - 1];
        array[array.length - i - 1] = temp;
    }

Sort int[] array big to small

3 Answers3