Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- import java.util.Random;
- public class ExchangeSort
- {
- public static void exchange_sort( int[] a )
- {
- for ( int i = 0; i < a.length-1; i ++ )
- for ( int z = i+1; z < a.length; z ++ )
- {
- if ( a[i] < a[z] )
- {
- swap( a, a[i], a[z] );
- // int temp = a[i];
- // a[i] = a[z];
- // a[z] = temp;
- }
- }
- }
- public static void swap( int[] a , int i, int j )
- {
- int temp = a[i];
- a[i] = a[j];
- a[j] = temp;
- }
- public static void main( String[] args )
- {
- Random r = new Random();
- int[] arr = new int[10];
- int i;
- // Fill up the array with random numbers
- for ( i=0; i<arr.length; i++ )
- arr[i] = 1 + r.nextInt(100);
- // Display it
- System.out.print("before: ");
- for ( i=0; i<arr.length; i++ )
- System.out.print( arr[i] + " " );
- System.out.println();
- // Sort it
- exchange_sort( arr );
- // Display it again to confirm that it's sorted
- System.out.print("after : ");
- for ( i=0; i<arr.length; i++ )
- System.out.print( arr[i] + " " );
- System.out.println();
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement