第k小/大问题/快速排序

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <sys/time.h>
void mod202120430();
int num_rand(int start,int end)//return an number between[start,end)
{

    return rand()% (end - start+1) + start;
}
int partition(int* input , int low, int high)
{
    int tmp = input[low];// 取一个基准元素
    while(low < high)
    {
        while(low < high && input[high] >= tmp)
        {
            high--;
        }
        input[low] = input[high];
        while (low < high && input[low] <= tmp)
        {
            low++;
        }
        input[high]=input[low];
    }
    input[low]=tmp;
    return low;
}
int findK(int* array,int left,int right,int k)
{
    int i = partition(array,left,right);
    int cnt = i - left + 1;
    if(k == cnt)
    {
        return array[i];
    }else if(k < cnt)
    {
        return findK(array,left,i-1,k);
    }else if(k > cnt)
    {
        return findK(array, i + 1, right , k - cnt);

    }
    return 0;
}
void output(int **a, int n)
{
    for(int i = 1;i <= n; i++)
    {
        for(int j = 1;j <=n; j++)
        {
            printf("%d ",a[i][j]);
        }
        printf("\n");
    }
}
void table(int k,int n, int **a)
{
    for(int i =1; i<=n; i++)
    {
        a[1][i] = i;//set table first line
    }
    int m = 1;//origin fill place
    for( int s = 1; s <= k; s++)
    {
        n /= 2;
        for (int t = 1; t <= n; ++t) {
            for (int i = m + 1; i <= 2* m; ++i) {//row contral
                for(int j = m + 1; j <= 2 * m; j++)//column contral
                {
                    //the botton right is set to the top left
                    a[i][j + (t - 1) * m * 2] = a[i - m][j + (t - 1) * m * 2 -m];
                    //the botton left is set to the top right
                    a[i][j + (t - 1) * m * 2] = a[i - m][j + (t -1) * m * 2];
                }
            }
        }
        m *= 2;
    }

}
int main() {

    //mod202120430();
    /*
    srand(time(0));
    int arr[60]= {0};
    printf("arr=\n");
    int count=0;//create random number array
    for(int i = 0; i < 59; i++)
    {
        arr[i]=num_rand(100,10000);
        printf("%d ",arr[i]);
        if(count%10==0)
        {
            printf("\n");
        }
    }
    printf("======================================\n");
    printf("find the kth smallset:");
    int k;
    scanf("%d",&k);
//    由于只要求找出第k大的数，没必要将数组中所有值都排序。
//    快排中的partition算法，返回key在数组中的位置的cnt（相对于left的偏移量），
//    如果cnt正好等于k，那么问题则得到解决；如果cnt小于k，去左边找第k个；如果cnt>k，
//    则去右边找第k-cnt个。直到key的位置等于k-1，则找对问题的解。
    int kthNum = findK(arr,0,59,k);
    printf("%d",kthNum);
    */
    printf("input team number:");
    int k = scanf("%d",&k);
    int n =1;
    //n=2*k of competitors
    for(int i = 1; i <= k; i++)
    {
        n*=2;
    }
    //base on n to dyanmic malloc memory
    int **a = malloc(sizeof(int*)*(n+1));
    for(int i = 0; i <= n; i++)
    {
        a[i] = malloc(sizeof(int)*(n+1));
    }
    table(k , n ,a);
    printf("circle match table is:\n");
    output(a, n);
    //free memory
    for( int i = 0; i <= n; i++)
    {
        free(a[i]);
    }
    free(a);
    return 0;
}
void mod202120430(){
    printf("1900300425 after mod 202120430:%d",1900300425%202120430);
}