文件"rand_3w.txt"中有三万个随机的、各不相等的正整数，写一个函数，求第k小的数。（如1、2、3、4、5，中第3小的数为3）

1. 文件"rand_3w.txt"中有三万个随机的、各不相等的正整数，写一个函数，求第k小的数。（如1、2、3、4、5，中第3小的数为3）
2. 博文中第一个是关于二级指针的，自己写下二级指针删除单向链表节点的操作。


http://blog.csdn.net/hjj414/article/details/17487055

http://coolshell.cn/articles/10688.html

#include <stdio.h>
#include <stdlib.h>


#define SELECT 0


#if SELECT//题目一
int partion(int a[],int p,int r){
    int x = a[r];     //通常，拿最后一个值，作为预期的中间值
    int middle = p;   //记录“较小的一段数据”的最大下标。通常这个值在p和r的中间，故起名middle
    int j;
    for (j = p ; j < r ; j++){
        if (a[j] < x){
            int temp  = a[middle];
            a[middle] = a[j];
            a[j] = temp;
            middle++;
        }
    }
    int temp = a[r];
    a[r]     = a[middle];
    a[middle] = temp;
    return middle;
}


void QuickSort(int a[],int p,int r){
    if (p<r){
        int q=partion(a,p,r);
        QuickSort(a,p,q-1);
        QuickSort(a,q+1,r);
    }
}


int main()
{
    FILE* fp;
    int num,i=0,k=0;
    int * array=malloc(sizeof(int)*30005);
    memset(array,0,sizeof(int)*30005);
    fp = fopen("rand_3w.txt","r+");
if (fp==NULL)
{
printf("rand_3w.txt cannot open!\n");
return -1;
}


    do{
        fscanf(fp,"%d",&array[i++]);
    }while (fgetc(fp) != EOF);  //
    printf("共读入%d个数\n",--i);
    QuickSort(array,0,i-1);
    while(1)
    {
        printf("想得到第几小的值？输入负数退出");
        scanf("%d",&k);
        if(k<=0)
            return;
        printf("第%d小的值为%d\n",k,array[k-1]);
    }
    fclose(fp);
}
#else//题目二


typedef struct Node
{
    int data;
    struct Node *next;
}Node,*Linkedlist;


typedef int (* remove_fn)(Node  const * v);


int wetherToRemove(Node  const * v)
{
    if (v->data%2==1)
        return 1;
    else
        return 0;
}




void remove_if(Node ** head,remove_fn rm)
{
    Node** curr;
    for (curr = head; *curr; )
    {
        Node * entry = *curr;
        if (rm(entry))
        {
            *curr = entry->next;
            free(entry);
        }
        else
            curr = &entry->next;
    }
}






Linkedlist initialLinkedList(int n)
{
int i;
Linkedlist head,curr,temp;


head = (Linkedlist)malloc(sizeof(Node));
head->data = 0;
head->next = NULL;
curr = head;
for (i=1;i<n;i++)
{
temp = (Linkedlist)malloc(sizeof(Node));
temp->data = i;
temp->next = NULL;
curr=curr->next = temp;


}
return head;
}


void printLinkedList(Linkedlist head)
{
    Linkedlist curr=head;
    do
    {
        printf("%d->",curr->data);
        curr=curr->next;
    }while(curr!=NULL);
    printf("end\n");
}


int main(void)
{
    int n;
    Linkedlist curr,head;
    Linkedlist * headpointer;
    remove_fn rm=wetherToRemove;
printf("Enter n:\n");
scanf("%d",&n);
head = initialLinkedList(n);
headpointer = &head;
printf("原始链表\n");
printLinkedList(head);
    remove_if(headpointer,rm);
printLinkedList(head);
return 0;
}
#endif