0

hi Guys

this is my problem :

a) what should i have to show to Proove that a sort algorithm work well

b)what is the order of this algorithm :

```
void mySort(int[]A , int n){
int t,i;
for (i=1 ; i<=n; i++){
while(A[i] != i){
t = A[i];
A[i] = A[t];
A[t] = t;
}
}
}
```

notice that indexes of array start with 1 and ends with n

Thanks everyone