UNKNOWN //************************************** // Name: Insertion sort // Description:Simple implementation of Insertion sort. // By: Puneet Jindal // // // Inputs:None // // Returns:None // //Assumes:None // //Side Effects:None //This code is copyrighted and has limited warranties. //Please see http://www.Planet-Source-Code.com/xq/ASP/txtCodeId.13839/lngWId.3/qx/vb/scripts/ShowCode.htm //for details. //************************************** // // Insertion sort(Ascending order) // #include<iostream> using namespace std; void Sort(int *arr, int len = -1) { if(len == -1) return; for(int i = 1 ; i < len ; ++i) { for(int j = 0 ; j < i ; ++j) { if(arr[i] < arr[j]) { int temp = arr[i]; for(int k = i ; k > j ; --k) arr[k] = arr[k-1]; arr[j] = temp; break; } } } } int main() { int arr[] = {9,6,8,23,67,56,78,34}; Sort(arr,8); for(int i = 0 ; i < 8 ; ++i) cout<<arr[i]<<" "; return 0; }