插值排序法排序数组

插入排序的主要优点是易于编码，但是速度慢。

//Fig.7.20:fig07-20.cpp

//This program sorts an array's values into searching order.

#include <iostream>
using std::cout;
using std::cin;
using std::endl;

#include <iomanip>
using std::setw;

int linearSearch(const int [],int,int);//prototype

int main()
{
   const int  arraySize = 10;//sise of array a
   int data[arraySize] = {34,56,4,10,77,51,93,30,5,52};
   int insert;//temporary variable to hold element to insert

   cout<<"Unsorted array:\n";

   //output original array
   for(int i = 0;i < arraySize ;i++)
      cout << setw(4)<<data[i];

   //insertion sort
   //loop over the elements of the array
   for(int next =1;next < arraySize; next++)
     {
      insert = data[next];//store the value in the current element
      int moveItem = next;//initialize location to place element

      //search for the location in which to put the current element
      while((moveItem > 0)&&(data[moveItem - 1]>insert))
      {
       //shift element one slot to the right
       data[moveItem] = data[moveItem - 1];
       moveItem--;
      }//end while
        data[moveItem] = insert;//place inserted element into the array
     }//end for

    cout << "\nSorted array:\n";

     //output original array
   for(int i = 0;i < arraySize ;i++)
      cout << setw(4)<<data[i];
      cout<<endl;
    

    return 0;//indicates successful termination
}