sorting.c

Go to the documentation of this file.

#include "turtle.h"
#include "sorting.h"

int bubble_sort(LONGVECTOR *v,short print) {
        long i,mk;

        int swapped=1;

        long n=v->nh;
        do {
                swapped=0;
                n=n-1;
                for(i=v->nl;i<=n;i++){
                        if (v->element[i]>v->element[i+1]){
                                mk=v->element[i];
                                v->element[i]=v->element[i+1];
                                v->element[i+1]=mk;
                                swapped=1;
                        }
                }
                if (n<v->nl && swapped==1) {
                        printf("Error in bubble_sort longvector was not correctly sorted!! ");
                        print_longvector_elements(v,print);
                        swapped=1;
                }
        } while (swapped==1);

        return 0;
}

LONGVECTOR *addresses_bubble_sort(LONGVECTOR *v,short print) {
        long i,mk,lk;

        int swapped=1;

        long n=v->nh;

        LONGVECTOR *la;

        la=new_longvector(v->nh);

        for (i=la->nl;i<=la->nh;i++) {
                la->element[i]=i;
        }


        do {
                swapped=0;
                n=n-1;
                for(i=v->nl;i<=n;i++){
                        if (v->element[i]>v->element[i+1]){
                                mk=v->element[i];
                                v->element[i]=v->element[i+1];
                                v->element[i+1]=mk;
                                lk=la->element[i];
                                la->element[i]=la->element[i+1];
                                la->element[i+1]=lk;
                                swapped=1;
                        }
                }
                if (n<v->nl && swapped==1) {
                        printf("Error in bubble_sort longvector was not correctly sorted!! ");
                        print_longvector_elements(v,print);
                        swapped=1;
                }
        } while (swapped==1);

        return la;
}


int bubble_sort_matrix(LONGVECTOR *v, LONGMATRIX *m, short print) {
        LONGVECTOR *iv;
        long r,c,mk,lk;

        if (v->nh!=m->nrh) printf("Error in bubble_sort_matrix the vector to b sorted and the matrix has different size: %ld and %ld (rows)/n",v->nh,m->nrh);


        iv=addresses_bubble_sort(v,print);
        for (r=m->nrl;r<=m->nrh;r++) {
                lk=iv->element[r];
                if (lk!=r) {
                        for (c=m->ncl;c<=m->nch;c++){
                                mk=m->element[r][c];
                                m->element[r][c]=m->element[lk][c];
                                m->element[lk][c]=mk;
                        }
                        iv->element[r]=r;
                        iv->element[lk]=lk;
                }
        }




        if (print==1) printf("Function bubble_sort_matrix was successfully executed! \n");

        return 0;

}


//int sort_by_address(LONGVECTOR *all){
//      LONGVECTOR *addresses_bubble_sort(LONGVECTOR *v,short print)
//}//