九度 题目1202：排序

题目来源：http://ac.jobdu.com/problem.php?pid=1202

时间限制：1 秒

内存限制：32 兆

特殊判题：否

提交：9374

解决：3285

题目描述：

    对输入的n个数进行排序并输出。

输入：

    输入的第一行包括一个整数n(1<=n<=100)。
    接下来的一行包括n个整数。

输出：

    可能有多组测试数据，对于每组数据，将排序后的n个整数输出，每个数后面都有一个空格。
    每组测试数据的结果占一行。

样例输入：

4
1 4 3 2

样例输出：

1 2 3 4 

来源：

2006年华中科技大学计算机保研机试真题

快排：

#include <iostream>
#include <cstdio>
#include <cstring>

using namespace std;

const int MAXN = 110;

int Partition(int* arr, int low, int high)
{
    int i = low, j = high+1;
    if(low < high)
    {
        while(i < j)
        {
            ++i;
            while(arr[low] > arr[i])
                ++i;
            --j;
            while(arr[low] < arr[j])
                --j;
            if(arr[i] != arr[j] && i < j)
            {
                arr[i] ^= arr[j];
                arr[j] ^= arr[i];
                arr[i] ^= arr[j];
            }
        }
        if(arr[low] != arr[j])
            arr[j] ^= arr[low], arr[low] ^= arr[j], arr[j] ^= arr[low];
    }
    return j;
}

void Quick_sort(int* arr, int low, int high)
{
    if(low >= high)
        return ;
    int mid = Partition(arr, low, high);
    Quick_sort(arr, low, mid-1);
    Quick_sort(arr, mid+1, high);
    return ;
}

int main()
{
    int n, i;
    int arr[MAXN];
    while(~scanf("%d", &n))
    {
        for(i = 0; i < n; ++i)
            scanf("%d", &arr[i]);
        Quick_sort(arr, 0, n-1);
        for(i = 0; i < n; ++i)
            printf("%d ", arr[i]);
        printf("\n");
    }
    return 0;
}

归并：

#include <iostream>
#include <cstdio>
#include <cstring>

using namespace std;

const int MAXN = 110;

int arr[MAXN], b[MAXN];

void Merge(int low, int mid, int high)
{
    int i = low, j = mid+1, k = low;
    while(i <= mid && j <= high)
    {
        if(arr[i] <= arr[j])
            b[k++] = arr[i++];
        else
            b[k++] = arr[j++];
    }
    while(i <= mid)
        b[k++] = arr[i++];
    while(j <= high)
        b[k++] = arr[j++];
    for(i = low; i <= high; ++i)
        arr[i] = b[i];
}

void Merge_Sort(int low, int high)
{
    if(low >= high)
        return ;
    int mid = (low + high)>>1;
    Merge_Sort(low, mid);
    Merge_Sort(mid+1, high);
    Merge(low, mid, high);
}

int main()
{
    int n, i;
    while(scanf("%d", &n) != EOF)
    {
        for(i = 0; i < n; ++i)
            scanf("%d", &arr[i]);
        Merge_Sort(0, n-1);
        for(i = 0; i < n; ++i)
            printf("%d ", arr[i]);
        printf("\n");
    }
    return 0;
}

直接调用快排：

#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>

using namespace std;

const int MAXN = 110;
int main()
{
    int n, i, arr[MAXN];
    while(~scanf("%d", &n))
    {
        for(i = 0; i < n; ++i)
            scanf("%d", &arr[i]);
        sort(arr, arr+n);
        for(i = 0; i < n; ++i)
            printf("%d ", arr[i]);
        printf("\n");
    }
    return 0;
}

堆排序：

#include <iostream>
#include <cstring>
#include <cstdio>

using namespace std;

const int MAXN = 110;

struct HeapNode
{
	int arr[MAXN];
	int iSize;
	HeapNode()
	{
		memset(arr, 0, sizeof(arr));
		iSize = 0;
	}
};

void Insert_Heap(HeapNode* pHeap, int iData)
{
	int sz = pHeap->iSize++;
	while (sz>0)
	{
		if(iData < pHeap->arr[(sz-1)>>1])
		{
			pHeap->arr[sz] = pHeap->arr[(sz-1)>>1];
			pHeap->arr[(sz-1)>>1] = iData;
			sz = (sz-1)>>1;
		}
		else
		{
			pHeap->arr[sz] = iData;
			return ;
		}
	}
	pHeap->arr[0] = iData;
}

void Delete_Heap(HeapNode* pHeap)
{
	printf("%d ", pHeap->arr[0]);
	pHeap->iSize--;
	pHeap->arr[0] = pHeap->arr[pHeap->iSize];
	pHeap->arr[pHeap->iSize] = 0;
	int index = 1, iData = pHeap->arr[0];
	while (index < pHeap->iSize)
	{
		if(index < pHeap->iSize-1 && pHeap->arr[index] > pHeap->arr[index+1])
			++index;
		if(iData > pHeap->arr[index])
		{
			pHeap->arr[(index-1)>>1] = pHeap->arr[index];
			pHeap->arr[index] = iData;
			index = index<<1|1;
		}
		else
			return ;
	}
}

int main()
{
	int n, i, iData;
	while (~scanf("%d", &n))
	{
		HeapNode* pHeap = new HeapNode();
		for (i = 0; i < n; ++i)
		{
			scanf("%d", &iData);
			Insert_Heap(pHeap, iData);
		}
		while (n--)
			Delete_Heap(pHeap);
		printf("\n");
		delete pHeap;
	}
	return 0;
}

优先级队列：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <queue>

using namespace std;


int main()
{
	int n, iData;
	while (~scanf("%d", &n))
	{
		priority_queue <int, vector <int>, greater <int> > Q;
		while(n--)
		{
			scanf("%d", &iData);
			Q.push(iData);
		}
		while (!Q.empty())
		{
			printf("%d ", Q.top());
			Q.pop();
		}
		printf("\n");
	}
	return 0;
}