冒泡排序和快速排序

<span style="font-family: Arial, Helvetica, sans-serif;">using namespace std;  </span>

void IdiotSort(int *data,int start,int end)  
{   int length=end-start+1;  
    for(int i=0;i<length;++i)  
       for(int j=0;j<length-i;j++)  
          {  
            if(data[j]>data[j+1])  
                {  
                 int temp=data[j];  
                 data[j]=data[j+1];  
                 data[j+1]=temp;  
                }             
                   
          }   
}   
int main()  
{  
    int A[10]={10,4,2,6,4,3,21,23,43,4};<pre name="code" class="cpp">#include <iostream>  
using namespace std;  
void Swap(int &a,int &b)  
{  
  int   temp=a;  
    a=b;  
    b=temp;  
}  
int Partition(int *data,int start,int end)  
{  
    int key=data[end];  //一次