Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <cstdlib>
- #include <iostream>
- using namespace std;
- {
- void insertion_sort(int arr[], int length);
- int qwerty() {
- int arr[10]={1,2,3,4,5,6,7,8,9,10};
- insertion_sort(arr,10);
- return 0;
- }
- void insertion_sort(int arr[], int length) {
- int i,j,tmp;
- for(i=1; i<length; i++){
- i=j;
- while(j>0 && a[j-1]>a[j]){
- tmp=arr[j];
- arr[j]=arr[j-1];
- arr[j-1]=tmp;
- j--;
- }
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement