qwop

[code="c"]#include int halfSearch( int arr[], int num, int size ) { int min = 0, max = ( size - 1), mid; if ( size == 0 ) { return -1; } while ( 1 ) { // 1. when the boundary is "min" or ...

[code="c"]#include void insertSort( int arr[] , int size ) { int i , j , k , f /*First element*/; // 0 1 2 3 4 // 4 3,2,1 // 3 4 2,1 // 2 3 4 1 // 1. 遍历无序区域 for ( i = 1; i < ...