void swap(int* num, int a, int b){

        if(a == b) return;

        int tmp = num[a];

        num[a] = num[b];

        num[b] = tmp;

    }

    void sort(int* num, int size){

        int i = ;

        //move 0 to num[0]

        for(;i<size;i++){

            if(num[i] == ){

                swap(num, i, );

               }

            }

            i = ;

            while(i<size){

            //postion matched value

              if(num[i] == i){

                 i++;

            }

            //postion mismatch value, then need to place value to the correct postition and continue

            else{

                int tarpos = num[i];

                swap(num, , tarpos); // num[tarpos] = 0

                swap(num, tarpos,i); // num[i] = 0

                swap(num, , i); // num[0] = 0

            }

        }

    }

    int main(){

        int input[] = {,,,};

        sort(input, );

        int t = ;

        for(;t<;t++)

            printf("%d->",input[t]);

        printf("n");

    }