quicksortalgorithm.h

实现了对文本文件的huffman编码与解码过程

#include <iostream>
using namespace std;



void QuickSortAlg(float a[], int front, int end)
{
	int newfront = front;
	int newend = end;
	int i = newfront;

	while(end!=front)
	{		
		if(front == i)
		{
			if(a[i]>a[end])
			{
				swap(a[i], a[end]);
				front++;
				i = end;
			}
			else
			{
				end--;
			}
		}
		else
		{
			if(a[i]<a[front])
			{
				swap(a[i], a[front]);
				end--;
				i = front;

			}
			else
			{
				front++;
			}
		}
	}

	if(newfront != front)
	{
		QuickSortAlg(a, newfront, front-1);
	}
	if( newend != front)
	{
		QuickSortAlg(a, front+1, newend);
	}		
}