数组实现排序以及最大最小数字

程序员成长之旅 · 程序员成长之旅/Java学习/源码 · 246 字

public class MaxAndMin { public static void main(String[] args) { int flag1 = 0; int flag2 = 0; int[] date = { 313, 89, 123, 323, 313, 15, 90, 56, 39 }; for (flag1 = date.length - 1; flag1 > 0; flag1--) { for (flag2 = 0; flag2 < flag1; flag2++) { if (date[flag2] < date[flag2 + 1]) { int temp = date[flag2]; date[flag2] = date[flag2 + 1]; date[flag2 + 1] = temp; } } } System.out.print("排序后数组为:["); for (int num : date) { System.out.print(num); if (num != date[date.length - 1]) { System.out.print(","); } } System.out.println("]"); System.out.println("最大数字为["+date[0]+"]"+"最小数字为["+date[date.length-1]+"]"); } }

31

1 public

class

MaxAndMin

{ 2

public

static

void

main ( String [] args ) { 3

int

flag1

=

0 ; 4

int

flag2

=

0 ; 5

int [] date

= { 313 , 89 , 123 , 323 , 313 , 15 , 90 , 56 , 39 }; 6 7

for ( flag1

=

date . length

1 ; flag1

0 ; flag1

) { 8

for ( flag2

=

0 ; flag2

<

flag1 ; flag2 ++ ) { 9

if ( date [ flag2 ] <

date [ flag2

1 ]) { 10

int

temp

=

date [ flag2 ]; 11

date [ flag2 ]

date [ flag2

1 ]; 12

date [ flag2

1 ]

temp ; 13 } 14 } 15 } 16 17

System . out . print ( "排序后数组为:[" ); 18 19

for ( int

num : date ) { 20

System . out . print ( num ); 21 22

if ( num

!=

date [ date . length

1 ]) { 23

System . out . print ( "," ); 24 } 25 } 26 27

System . out . println ( "]" ); 28 29

System . out . println ( "最大数字为[" + date [ 0 ] + "]" + "最小数字为[" + date [ date . length

1 ] + "]" ); 30 } 31 }