How to Quick-Sort Strings in C

Asked May 28 '17 at 13:14

Active May 28 '17 at 13:26

Viewed 297 times

I coded it myself first and tried copy-paste'ing and implementing other quicksort codes from the internet. None of those worked.

void quickSort (char** tmpDictionary, int left, int right) {
    int pivot, i, j;
    char tmp[BUFFER_LENGTH];
    if (right > left) {
        pivot = left;
        i = left;
        j = right;
        while (i < j) {
            while ((strcmp(tmpDictionary[pivot], tmpDictionary[i]) >= 0) && (right > i)) {
                i++;
            }

            while ((strcmp(tmpDictionary[j], tmpDictionary[pivot]) == 1)) {
                j--;
            }

            if (i < j) {
                printf("%s ile %s yer degistiriyor.\n", tmpDictionary[i], tmpDictionary[j]);
                strcpy(tmp, tmpDictionary[i]);
                strcpy(tmpDictionary[i], tmpDictionary[j]);
                strcpy(tmpDictionary[j], tmp);
                quickSort(tmpDictionary, left, j-1);
                quickSort(tmpDictionary, j+1, right);
            }
        }
    }
}

What am I doing wrong here?

edited May 28 '17 at 13:23

J-Alex

6,881
10
46
64

asked May 28 '17 at 13:14

2

At least you need to call `quickSort` to the substructure after splitting is finished. – BLUEPIXY May 28 '17 at 13:17
aren't I doing so at the end of the function? – May 28 '17 at 13:24
1

Reconsider your code. – BLUEPIXY May 28 '17 at 13:26
1

It seems you don't quite grasp the concept of quicksort. How many recursive calls do you need? – n. m. could be an AI May 28 '17 at 13:59
As you were told, you are recursing far too often, and before you've finished partitioning the data. – Jonathan Leffler May 28 '17 at 13:59

How to Quick-Sort Strings in C

0 Answers0