| 15 | } |
| 16 | |
| 17 | void InsertSort(struct Array *arr,int x) |
| 18 | { |
| 19 | int i=arr->length-1; |
| 20 | if (arr->length==arr->size) return ; |
| 21 | while (i>=0 && arr->A[i]>x) |
| 22 | { |
| 23 | arr->A[i+1]=arr->A[i]; |
| 24 | i--; |
| 25 | } |
| 26 | |
| 27 | |
| 28 | |
| 29 | arr->A[i+1]=x; |
| 30 | |
| 31 | arr->length++; |
| 32 | |
| 33 | } |
| 34 | |
| 35 | |
| 36 | int main() |