排序和查找

#include<bits/stdc++.h>
#define N 10090000
using namespace std;
int n, a[N], last[N],  k;

void menu1()
{
    cout << endl;
    printf("\t\t\t1.简单选择排序\n");
    printf("\t\t\t2.直接插入排序\n");
    printf("\t\t\t3.冒泡排序\n");
    printf("\t\t\t4.希尔排序\n");
    printf("\t\t\t5.快速排序\n");
    printf("\t\t\t6.堆排序\n");
    printf("\t\t\t7.退出\n");
}

void menu2()
{
    cout << endl;
    printf("\t\t\t1.分块查找\n");
    printf("\t\t\t2.二分查找\n");
    printf("\t\t\t3.退出\n");
}


void Sel_sort()//选择
{
    int  i, j;
    scanf("%d", &n);
    for(i = 1; i <= n; i++) scanf("%d", &a[i]);
    for(i = 1; i <= n; i++)
    {
        for(j = i + 1; j <= n; j++)
        {
            if(a[i] > a[j]) swap(a[i], a[j]);
        }
    }
    for(i = 1; i <= n; i++) printf("%d%c", a[i], i == n ? '\n' : ' ');
}

void Insert_sort()//插入
{
    int  i, j, num;
    scanf("%d", &n);
    for(i = 1; i <= n; i++)
    {
        scanf("%d", &num);
        int len = i;
        for(j = 1; j < len; j++) if(a[j] > num) break;
        int cur = j;
        for(j = len; j > cur; j--) a[j] = a[j - 1];
        a[cur] = num;
    }
    for(i = 1; i <= n; i++) printf("%d%c", a[i], i == n ? '\n' : ' ');
}

void Mp_sort()//冒泡
{
    int  i, j;
    scanf("%d", &n);
    for(i = 1; i <= n; i++) scanf("%d", &a[i]);
    for(i = 1; i <= n; i++)
    {
        for(j = 1; j <= n-i; j++)
            if(a[j] > a[j+1]) swap(a[j], a[j+1]);
    }
    for(i = 1; i <= n; i++) printf("%d%c", a[i], i == n ? '\n' : ' ');
}


void Shell_sort()//希尔
{
    int  i, j;
    scanf("%d", &n);
    for(i = 1; i <= n; i++) scanf("%d", &a[i]);
    int dk = n>>1;
    while(dk)
    {
        for(i = 1 + dk; i <= n; i++)
        {
            if(a[i] < a[i-dk])
            {
                j = i - dk;
                int x = a[i];
                while(j >= 1 && x < a[j])
                {
                    a[j+dk] = a[j];
                    j -= dk;
                }
                a[j+dk] = x;
            }
        }
        dk >>= 1;
    }
    for(i = 1; i <= n; i++) printf("%d%c", a[i], i == n ? '\n' : ' ');
}


int Partition(int a[], int low, int high)
{
    int cur = a[low];
    while(low < high)
    {
        while(low < high && a[high] > cur) high--;
        swap(a[low], a[high]);
        while(low < high && a[low] < cur) low++;
        swap(a[low], a[high]);
    }
    return low;
}

void qq_sort(int a[], int low, int high)
{
    if(low < high)
    {
        int mid = Partition(a, low, high);
        qq_sort(a, low, mid - 1);
        qq_sort(a, mid + 1, high);
    }
}

void q_sort()//快排
{
    int  i;
    scanf("%d", &n);
    for(i = 1; i <= n; i++) scanf("%d", &a[i]);
    qq_sort(a, 1, n);
    for(i = 1; i <= n; i++) printf("%d%c", a[i], i == n ? '\n' : ' ');
}

void heap_adjust(int a[], int pre, int n)
{
    int child = pre * 2 + 1;
    int tm = a[pre];
    while(child < n)
    {
        if(child + 1 < n && a[child] < a[child+1]) child++;
        if(a[pre] < a[child])
        {
            a[pre] = a[child];
            pre = child;
            child = pre * 2 + 1;
        }
        else break;
        a[pre] = tm;
    }
}

void Heap_sort()//堆
{
    int i;
    scanf("%d", &n);
    for(i = 0; i < n; i++) scanf("%d", &a[i]);
    for(i = ((n - 1)>>1); i >= 0; i--) heap_adjust(a, i, n);
    for(i = n - 1; i > 0; i--)
    {
        swap(a[i], a[0]);
        heap_adjust(a, 0, i);
    }
    for(i = 0; i < n; i++) printf("%d%c", a[i], i == n ? '\n' : ' ');
}
int solve(int x)
{
    for(int i=1; i<=k+1; i++)
    {
        if(x>last[i-1]&&x<=last[i])
        {
            int pos=(i-1)*k;
            for(int j=1; j<=k; j++)
            {
                if(x<=a[pos+j]) return pos+j;
            }
        }
    }
    return 0;
}
void blocking_searching()
{
    k=(int)sqrt(n*1.0);
    for(int i=1; i<=k; i++)   last[i]=a[i*k];
    last[k+1]=a[n],last[0]=-1;
    int x;
    while(scanf("%d", &x),x!=-1)
    {
        int t = clock();

        if(x<a[1]) cout<<1<<endl;
        else if(x>a[n]) cout<<(n+1)<<endl;
        else printf("%d\n",solve(x));

        cout<<"使用的时间："<<clock()-t<<endl;
    }
    return ;
}
void binary_searching()
{
    int x;
    while(scanf("%d", &x),x!=-1)
    {
        int t = clock();

        int l=1, r=n, ans=-1;
        while(l<=r)
        {
            int mid = (l+r)/2;
            if(a[mid]<x)l=mid+1;
            else if(a[mid]>x)r=mid-1;
            else
            {
                ans=1;
                break;
            }
        }
        if(ans==-1)cout<<"没有找到 使用的时间："<<clock()-t<<endl;
        else cout<<"找到了 使用的时间："<<clock()-t<<endl;
    }
    return ;
}

int main()
{
    freopen("Test.txt","r",stdin);
    while(true)
    {
        int sel;
        menu1();
        scanf("%d", &sel);
        switch(sel)
        {
            case 1: Sel_sort(); break;
            case 2: Insert_sort(); break;
            case 3: Mp_sort(); break;
            case 4: Shell_sort(); break;
            case 5: q_sort(); break;
            case 6: Heap_sort(); break;
        }
        if(sel == 7) break;

        menu2();
        scanf("%d", &sel);
        switch(sel)
        {
            case 1: blocking_searching(); break;
            case 2: binary_searching(); break;
        }
        if(sel == 3) break;
    }
    return 0;
}