首次推送

1.选择排序.c

@@ -0,0 +1,55 @@
+#include<stdio.h>
+#include<stdlib.h>
+
+#define N 8
+
+void select_sort(int a[],int n);
+
+
+//选择排序实现
+void select_sort(int a[],int n)//n为数组a的元素个数
+{
+	int i,j;
+	int min_index;
+	int temp;
+    //进行N-1轮选择
+    for(i=0; i<n-1; i++)
+    {
+        min_index = i; 
+        //找出第i小的数所在的位置
+        for(j=i+1; j<n; j++)
+        {
+            if(a[j] < a[min_index])
+            {
+                min_index = j;
+            }
+        }
+
+        //将第i小的数，放在第i个位置；如果刚好，就不用交换
+        if( i != min_index)
+        {
+            temp = a[i];
+            a[i] = a[min_index];
+            a[min_index] = temp;
+        }
+    }
+}
+
+
+int  main()
+{
+	int i;
+    int num[N] = {89, 38, 11, 78, 96, 44, 19, 25};
+
+    select_sort(num, N);
+
+    for(i=0; i<N; i++)
+        printf("%d  ", num[i]);
+
+    printf("\n");
+
+
+    system("pause");
+    return 0;
+
+}

2.冒泡排序.c

@@ -0,0 +1,72 @@
+#include<stdio.h>
+#include<stdlib.h>
+
+typedef enum { false, true } bool;
+
+#define N 8
+
+void bubble_sort(int a[],int n);
+
+
+//一般实现
+void bubble_sort(int a[],int n)//n为数组a的元素个数
+{
+	int i,j;
+    //一定进行N-1轮比较
+    for(i=0; i<n-1; i++)
+    {
+        //每一轮比较前n-1-i个，即已排序好的最后i个不用比较
+        for(j=0; j<n-1-i; j++)
+        {
+            if(a[j] > a[j+1])
+            {
+                int temp = a[j];
+                a[j] = a[j+1];
+                a[j+1]=temp;
+            }
+        }
+    }
+}
+
+//优化实现
+void bubble_sort_better(int a[],int n)//n为数组a的元素个数
+{
+	int i,j;
+	bool isSorted;
+	int temp;
+    //最多进行N-1轮比较
+    for(i=0; i<n-1; i++)
+    {
+        isSorted = true;
+        //每一轮比较前n-1-i个，即已排序好的最后i个不用比较
+        for(j=0; j<n-1-i; j++)
+        {
+            if(a[j] > a[j+1])
+            {
+                isSorted = false;
+                temp = a[j];
+                a[j] = a[j+1];
+                a[j+1]=temp;
+            }
+        }
+        if(isSorted) break; //如果没有发生交换，说明数组已经排序好了
+    }
+}
+
+
+int  main()
+{
+	int i;
+    int num[N] = {89, 38, 11, 78, 96, 44, 19, 25};
+
+    bubble_sort(num, N); //或者使用bubble_sort_better(num, N);
+
+    for(i=0; i<N; i++)
+        printf("%d  ", num[i]);
+
+    printf("\n");
+
+
+    system("pause");
+    return 0;
+}

3.插入排序.c

@@ -0,0 +1,53 @@
+#include<stdio.h>
+#include<stdlib.h>
+
+#define N 8
+
+void insert_sort(int a[],int n);
+
+
+//插入排序实现,这里按从小到大排序
+void insert_sort(int a[],int n)//n为数组a的元素个数
+{
+	int i,j,k;
+	int temp;
+    //进行N-1轮插入过程
+    for(i=1; i<n; i++)
+    {
+        //首先找到元素a[i]需要插入的位置
+        j=0;
+        while( (a[j]<a[i]) && (j<i))
+        {
+            j++;
+        }
+
+        //将元素插入到正确的位置
+        if(i != j)  //如果i==j，说明a[i]刚好在正确的位置
+        {
+            temp = a[i];
+            for(k = i; k > j; k--)
+            {
+                a[k] = a[k-1];
+            }
+            a[j] = temp;
+        }
+    }
+}
+
+
+int  main()
+{
+	int i;
+    int num[N] = {89, 38, 11, 78, 96, 44, 19, 25};
+
+    insert_sort(num, N);
+
+    for(i=0; i<N; i++)
+        printf("%d  ", num[i]);
+
+    printf("\n");
+
+
+    system("pause");
+    return 0;
+}

4.快速排序.c

@@ -0,0 +1,50 @@
+#include <stdio.h>
+#include <stdlib.h>
+#define N 6
+
+int partition(int arr[], int low, int high){
+    int key;
+    key = arr[low];
+    while(low<high){
+        while(low <high && arr[high]>= key )
+            high--;
+        if(low<high)
+            arr[low++] = arr[high];
+        while( low<high && arr[low]<=key )
+            low++;
+        if(low<high)
+            arr[high--] = arr[low];
+    }
+    arr[low] = key;
+
+    return low;
+}
+
+void quick_sort(int arr[], int start, int end){
+    int pos;
+    if (start<end){
+        pos = partition(arr, start, end);
+        quick_sort(arr,start,pos-1);
+        quick_sort(arr,pos+1,end);
+    }
+
+    return;
+}
+
+int main(void){
+    int i;
+    int arr[N]={32,12,7, 78, 23,45};
+
+    printf("ÅÅÐòÇ° \n");
+    for(i=0;i<N;i++)
+        printf("%d\t",arr[i]);
+    quick_sort(arr,0,N-1);
+
+    printf("\n ÅÅÐòºó \n");
+    for(i=0; i<N; i++)
+        printf("%d\t", arr[i]);
+    printf ("\n");
+
+    system("pause");
+    return 0;
+}

5.归并排序.c

@@ -0,0 +1,70 @@
+#include <stdio.h>
+#include <stdlib.h>
+#define N 7
+
+void merge(int arr[], int low, int mid, int high){
+    int i, k;
+    int *tmp = (int *)malloc((high-low+1)*sizeof(int));
+    //申请空间，使其大小为两个
+    int left_low = low;
+    int left_high = mid;
+    int right_low = mid + 1;
+    int right_high = high;
+
+    for(k=0; left_low<=left_high && right_low<=right_high; k++){  // 比较两个指针所指向的元素
+        if(arr[left_low]<=arr[right_low]){
+            tmp[k] = arr[left_low++];
+        }else{
+            tmp[k] = arr[right_low++];
+        }
+    }
+
+    if(left_low <= left_high){  //若第一个序列有剩余，直接复制出来粘到合并序列尾
+    //memcpy(tmp+k, arr+left_low, (left_high-left_low+l)*sizeof(int));
+    for(i=left_low;i<=left_high;i++)
+        tmp[k++] = arr[i];
+    }
+
+    if(right_low <= right_high){
+    //若第二个序列有剩余，直接复制出来粘到合并序列尾
+    //memcpy(tmp+k, arr+right_low, (right_high-right_low+1)*sizeof(int));
+        for(i=right_low; i<=right_high; i++)
+            tmp[k++] = arr[i];
+    }
+
+    for(i=0; i<high-low+1; i++)
+        arr[low+i] = tmp[i];
+    free(tmp);
+    return;
+}
+
+void merge_sort(int arr[], unsigned int first, unsigned int last){
+    int mid = 0;
+    if(first<last){
+        mid = (first+last)/2; /* 注意防止溢出 */
+        /*mid = first/2 + last/2;*/
+        //mid = (first & last) + ((first ^ last) >> 1);
+        merge_sort(arr, first, mid);
+        merge_sort(arr, mid+1,last);
+        merge(arr,first,mid,last);
+    }
+    return;
+}
+
+int main(){
+    int i;
+    int a[N]={32,12,56,78,76,45,36};
+
+    printf ("排序前 \n");
+    for(i=0;i<N;i++)
+        printf("%d\t",a[i]);
+
+    merge_sort(a,0,N-1);  // 排序
+
+    printf ("\n 排序后 \n");
+    for(i=0;i<N;i++)
+        printf("%d\t",a[i]); printf("\n");
+
+    system("pause");
+    return 0;
+}

6.顺序查找.c

@@ -0,0 +1,37 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <memory.h>
+
+int ordersearch(int a[], int n, int des){
+    int i;
+    for(i=0; i<n; i++)
+        if(des==a[i])
+            return 1;
+
+    return 0;
+}
+
+int main(){
+    int i, val;
+    int a[8] = {32,12,56,78,76,45,43,98};
+    int ret;
+
+    for(i=0; i<8; i++)
+        printf("%d\t", a[i]);
+   
+    printf("\n请输入所要查找的元素：");
+    while(1){
+        scanf("%d", &val);
+        fflush(stdin);
+        ret = ordersearch(a, 8, val);
+
+        if(1 == ret)
+            printf ("查找成功！");
+        else
+            printf ("查找失败！");
+
+        printf("\n请输入所要查找的元素：");
+    }
+
+    return 0;
+}

7.二分查找.c

@@ -0,0 +1,36 @@
+#include <stdio.h>
+
+binarySearch(int a[], int n, int key){
+    int low = 0;
+    int high = n - 1;
+    while(low<= high){
+        int mid = (low + high)/2;
+        int midVal = a[mid];
+        if(midVal<key)
+            low = mid + 1;
+        else if(midVal>key)
+            high = mid - 1;
+        else
+            return mid;
+    }
+    return -1;
+}
+
+int main(){
+    int i, val, ret;
+    int a[8]={-32, 12, 16, 24, 36, 45, 59, 98};
+    for(i=0; i<8; i++)
+        printf("%d\t", a[i]);
+
+    printf("\n请输人所要查找的元素：");
+    scanf("%d",&val);
+
+    ret = binarySearch(a,8,val);
+
+    if(-1 == ret)
+        printf("查找失败 \n");
+    else
+        printf ("查找成功 \n");
+
+    return 0;
+}

README.md

@@ -0,0 +1 @@
+排序与查找算法

数据结构和算法Flash动画演示/testArray.txt

@@ -0,0 +1 @@
+25,18,46,2,53,39,32,4,74,67