C语言拓展——选择排序、冒泡排序、二分法查找

选择排序

void  selectSort(int array[],int len){
    for (int i = 0; i < len - 1; i++) {
        for (int j = i + 1; j < len; j++) {
            if (array[i] > array[j]) {
                int temp = array[i];
                array[i] = array[j];
                array[j] = temp;
            }
        }
    }
}

冒泡排序

void bubbleSort(int array[],int len){
    for (int i = 0; i < len - 1; i++) {
        for (int j = 0; j < len - i - 1 ; j++) {
            if (array[j] > array[j + 1] ) {
                int temp = array[j];
                array[j] = array[j + 1];
                array[j + 1] = temp;
            }
        }
    }
}

二分查找

#include <stdio.h>
//向一个有序的数组中插入某个值，插入以后保证这个数组是依然有序的，找出插入位置
int findInsertValueIndex(int array[],int length,int insertValue){ 
    int min = 0;
    int max = length -1;
    int mid = -1;
    while (min <= max) {
        //计算中间位置
        mid = (max + min)/2;
        if (array[mid] == insertValue) {
            return  mid;
        }else if(array[mid] > insertValue){
            max = mid - 1;
        }else{
            min = mid + 1;
        }
    }
    return  mid;
}