数据结构——图 多种排序经典例子 冒泡排序 选择排序 插入排序 归并排序

图解决实际问题: 

    寻路算法: 最短路径  Dijkstra算法
    
常见查找与排序算法: 
    索引查找:  目录   给数据设计一个目录  先查目录 
    哈希查找:  将目标 进行哈希, 得到哈希值  即存储位置  
排序: 
    冒泡排序:  
    选择排序:
    插入排序:
    归并排序: 

    1.冒泡排序:  

#include <stdio.h>

void bubbleSort(int arr[], int n) {
    for (int i = 0; i < n-1; i++) {
        for (int j = 0; j < n-i-1; j++) {
            if (arr[j] > arr[j+1]) {
                // 交换arr[j]和arr[j+1]
                int temp = arr[j];
                arr[j] = arr[j+1];
                arr[j+1] = temp;
            }
        }
    }
}

int main() {
    int arr[] = {64, 34, 25, 12, 22, 11, 90};
    int n = sizeof(arr)/sizeof(arr[0]);
    bubbleSort(arr, n);
    printf("冒泡排序结果：");
    for (int i = 0; i < n; i++) {
        printf("%d ", arr[i]);
    }
    return 0;
}

    2.选择排序:

#include <stdio.h>

void selectionSort(int arr[], int n) {
    for (int i = 0; i < n-1; i++) {
        int min_idx = i;
        for (int j = i+1; j < n; j++) {
            if (arr[j] < arr[min_idx]) {
                min_idx = j;
            }
        }
        // 交换arr[i]和arr[min_idx]
        int temp = arr[i];
        arr[i] = arr[min_idx];
        arr[min_idx] = temp;
    }
}

int main() {
    int arr[] = {64, 34, 25, 12, 22, 11, 90};
    int n = sizeof(arr)/sizeof(arr[0]);
    selectionSort(arr, n);
    printf("选择排序结果：");
    for (int i = 0; i < n; i++) {
        printf("%d ", arr[i]);
    }
    return 0;
}

    3.插入排序:

#include <stdio.h>

void insertionSort(int arr[], int n) {
    for (int i = 1; i < n; i++) {
        int key = arr[i];
        int j = i - 1;
        while (j >= 0 && arr[j] > key) {
            arr[j+1] = arr[j];
            j--;
        }
        arr[j+1] = key;
    }
}

int main() {
    int arr[] = {64, 34, 25, 12, 22, 11, 90};
    int n = sizeof(arr)/sizeof(arr[0]);
    insertionSort(arr, n);
    printf("插入排序结果：");
    for (int i = 0; i < n; i++) {
        printf("%d ", arr[i]);
    }
    return 0;
}

    4.归并排序: 

#include <stdio.h>

void merge(int arr[], int left, int mid, int right) {
    int n1 = mid - left + 1;
    int n2 = right - mid;
    int L[n1], R[n2];

    for (int i = 0; i < n1; i++) {
        L[i] = arr[left + i];
    }
    for (int j = 0; j < n2; j++) {
        R[j] = arr[mid + 1 + j];
    }

    int i = 0, j = 0, k = left;
    while (i < n1 && j < n2) {
        if (L[i] <= R[j]) {
            arr[k] = L[i];
            i++;
        } else {
            arr[k] = R[j];
            j++;
        }
        k++;
    }

    while (i < n1) {
        arr[k] = L[i];
        i++;
        k++;
    }

    while (j < n2) {
        arr[k] = R[j];
        j++;
        k++;
    }
}

void mergeSort(int arr[], int left, int right) {
    if (left < right) {
        int mid = left + (right - left) / 2;
        mergeSort(arr, left, mid);
        mergeSort(arr, mid+1, right);
        merge(arr, left, mid, right);
    }
}

int main() {
    int arr[] = {64, 34, 25, 12, 22, 11, 90};
    int n = sizeof(arr)/sizeof(arr[0]);
    mergeSort(arr, 0, n-1);
    printf("归并排序结果：");
    for (int i = 0; i < n; i++) {
        printf("%d ", arr[i]);
    }
    return 0;
}

   5.快速排序：

#include <stdio.h>
//交换两个数
void change(int *a,int *b)
{
	*a ^= *b;
	*b ^= *a;
	*a ^= *b;
}

//快速排序
int quick_sort(int *arr,int len)
{
	//数组长度过小
	if(len <= 1) return 0; 
	//选择一个基准 
	//arr[0]
	//定义两个游标分别在近端和远端
	int i = 0,j = len-1;
	while(j > i)
	{//先移动远端
		while(*arr <= arr[j] && j > i) j--;
		while(*arr >= arr[i] && j > i) i++;
		if(i<j) change(arr+i,arr+j); 
	}
	if(i != 0)
		change(arr, arr+i);
	//i分割数组为两个部分
	quick_sort(arr, i);//前半部分
	quick_sort(arr+i+1, len-i-1);//后半部分
	return 0;
}


int show(int *arr,int len)
{
	while(len--) printf("%d ",*arr++);
	printf("\n");
}



int main()
{
	int arr[] = { 0 , 68,90,77,18,25,66,23,51,99};
	show(arr, sizeof(arr)/sizeof(int));
	quick_sort(arr, sizeof(arr)/sizeof(int));
	show(arr, sizeof(arr)/sizeof(int));
	return 0;
}

   6.桶排序

#include <stdio.h>
#define MAX 100

void bucketSort(int arr[], int n) {
    int i, j;
    int count[MAX] = {0};

    for (i = 0; i < n; i++) {
        count[arr[i]]++;
    }

    for (i = 0, j = 0; i < MAX; i++) {
        while (count[i] > 0) {
            arr[j++] = i;
            count[i]--;
        }
    }
}

int main() {
    int arr[] = {64, 34, 25, 12, 22, 11, 90};
    int n = sizeof(arr)/sizeof(arr[0]);
    bucketSort(arr, n);
    printf("桶排序结果：");
    for (int i = 0; i < n; i++) {
        printf("%d ", arr[i]);
    }
    return 0;
}