Thread: Function Pointer Problem

I have a some problem using function pointer

Above code start to case0 when I change the quicksorting algorthm quicksortarr is changed but after that when program go to other cases quicksortarr is changed therefore I can not compare sorting type result Why it is happened I don't have idea. Maybe it is a pointer problem

This is my problem part:

Code:

switch( k%4 ) {
    case 0:
    begin = clock();    
    quicksortarr = func(b, len);
    end = clock();    
    k++;
    break;
    case 1:        
    begin = clock();
    shellSortarr = func(b, len);
    end = clock();
    k++;
    break;
    case 2:        
    begin = clock();
    bubbleSortarr = func(b, len);
    end = clock();    
    k++;
    break;
    case 3:        
    begin = clock();
    selectionSortarr=func(b, len);    
    end = clock();
    compare(quicksortarr,shellSortarr,bubbleSortarr,selectionSortarr,len,i);
    k=0;    
    break;    
    }

This is my full code:

Code:

#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <string.h>
void print(int *arr, int len) {
    int i=0;
    for (i=0; i<len; i++){
        printf("%d ", arr[i]);
    }
    printf("\n");
}
int k=0;
int *selectionSort(int x1[],int len){
    int j,k,temp;
    for (j=0; j<len; j++) {
        int min=x1[j], ind=j;
        for (k=j+1; k<len; k++) {
            if(x1[k]<min){
                min=x1[k];
                ind=k;
            }
        }
        if(ind!=j) {
            temp=x1[ind];
            x1[ind]=x1[j];
            x1[j]=temp;
        }
    }
return x1;
}


int *bubbleSort(int x2[],int len){
 int pass,k,temp;
    for (pass=0; pass<len-1; pass++) {
 for (k=0; k<(len-pass-1); k++) {
 if(x2[k]>x2[k+1]){
 temp=x2[k];
 x2[k]=x2[k+1];
 x2[k+1]=temp;


 }
  
 }
 
 }
return x2;
}
int *shellSort(int x3[], int n){
    int temp,i,last,is_sorted;
    int jump=n/2;
    while(jump >=1){
        last= n-jump;
        is_sorted=0;
        while(!is_sorted){
            is_sorted=1;
            for(i=0; i<last; i++){
                if(x3[i]>x3[i+jump]){
                    temp=x3[i];
                    x3[i]=x3[i+jump];
                    x3[i+jump]=temp;
                    is_sorted=0;
                }
            }
        }
        jump=jump/2;
    }
    return x3;
}




void quicksort2(int x[],int first,int last){
    int pivot,j,temp,i;
         if(first<last){
         pivot=first;
         i=first;
         j=last;


         while(i<j){
             while(x[i]<=x[pivot]&&i<last)
                 i++;
             while(x[j]>x[pivot])
                 j--;
             if(i<j){
                 temp=x[i];
                  x[i]=x[j];
                  x[j]=temp;
             }
         }


         temp=x[pivot];
         x[pivot]=x[j];
         x[j]=temp;
         quicksort2(x,first,j-1);
         quicksort2(x,j+1,last);
        
    }
    
}
int *quickSort(int x[], int len) {
    quicksort2(x, 0, len - 1);
    return x;
}
 
void check_sort(int *a, int len) {
    int i;
    for (i = 1; i < len; i++)
        if (a[i - 1] > a[i])
            break;
    if (i < len) printf("!!!! BAD SORT !!!!\n");
}
void compare(int *arr1,int *arr2,int *arr3,int *arr4, int len,int y) {
    int i=0;
    int check=0;
        for (i=0; i<len; i++){
        if (arr1[i] != arr2[i] && arr1[i] != arr4[i] && arr1[i] != arr3[i])        
                check++;
                break;
            
    }
    if (check !=0) printf("%i . File's sorted arrays are not equal difference start at %i . variable in array\n",y,i);
    else printf("%i. File's sorted arrays are equal\n",y);
}
double sort(int *(*func)(int*, int), int *a, int len,int i) {
    time_t end, begin;
    int *b = malloc(len * sizeof *b);
    if (!b) { perror("sort: malloc"); return 0; }
    memcpy(b, a, len * sizeof b[0]);    
    int *selectionSortarr;
    int *quicksortarr;
    int *bubbleSortarr;
    int *shellSortarr;
    switch( k%4 ) {
    case 0:
    begin = clock();    
    quicksortarr = func(b, len);
    end = clock();    
    k++;
    break;
    case 1:        
    begin = clock();
    shellSortarr = func(b, len);
    end = clock();
    k++;
    break;
    case 2:        
    begin = clock();
    bubbleSortarr = func(b, len);
    end = clock();    
    k++;
    break;
    case 3:        
    begin = clock();
    selectionSortarr=func(b, len);    
    end = clock();
    compare(quicksortarr,shellSortarr,bubbleSortarr,selectionSortarr,len,i);
    k=0;    
    break;    
    }    
    check_sort(b, len);
    free(b);
    return (double)(end - begin) / CLOCKS_PER_SEC;
}
 




int main(int argc, char *argv[]) {
    int i,lenght[10];
    float quick[10],shell[argc],bubble[argc],selection[argc];
    for (i = 1; i < argc; i++) {
        FILE *f = fopen(argv[i], "r");
        if (!f) { perror(argv[i]); continue; }
                  
    int *a, len = 0, input;
    while (fscanf(f, "%d", &input) == 1) len++;
    a = malloc(len * sizeof *a);
    if (!a) { perror("do_sorts: malloc"); break; }
    len = 0;
    rewind(f);
    while (fscanf(f, "%d", &input) == 1) a[len++] = input;
    quick[i] = sort(quickSort,     a, len,i);
    shell[i] = sort(shellSort,     a, len,i);
    bubble[i] = sort(bubbleSort,    a, len,i);
    selection[i] = sort(selectionSort, a, len,i);
    lenght[i]=len;
    free(a);
    fclose(f);
    
    }
    printf("\nFilename:         ");
    for(i=1;i<argc;i++) {
    printf("\t%s\t", argv[i]);
    }
    printf("\nInput Numbers:    ");
    for(i=1;i<argc;i++) {
    printf("\t%i\t\t", lenght[i]);
    }


    printf("\nQuick Sort:       ");
    for(i=1;i<argc;i++)
    {
    printf("\t%f\t", quick[i]);
        
    }
    printf("\nShell Sort:      ");
    for(i=1;i<argc;i++)
    {
    printf("\t%f\t", shell[i]);
    }
    printf("\nBubble Sort:     ");
    for(i=1;i<argc;i++)
    {
       printf("\t%f\t", bubble[i]);
       
    }
    printf("\nSelection Short:");
    for(i=1;i<argc;i++)
    {
       printf("\t%f\t", selection[i]);
    }
    return 0;
}