프로그래밍이 좋아!

import java.util.*; public class MergeSort { public static void main( String[] args ) { int[] arrays = new int[32]; for( int i = 0; i < 32; i++ ) { arrays[ i ] = ( 32 - i ) * 2; } for( int i = 0; i < 32; i++ ) { System.out.println( i + "th : " + arrays[i] ); } mergeSort( 32, arrays ); for( int i = 0; i < 32; i++ ) { System.out.println( i + "th : " + arrays[i] ); } } public static void mergeSort(..

public static int BinarySearch( int[] array, int target ) { int min = 0; int max = array.length - 1; while (min != max) { int mid = ( min + max ) / 2; if ( array[ mid ] == target ) return mid; else if ( array[ mid ] > target ) max = mid - 1; else if ( array[ mid ] < target ) min = mid + 1; } return -1; }

public static int LinearSearch( int[] array, int target ) { for( int i = 0; i < array.length; i++ ) { if( array[i] == target ) return i; } return -1; }