We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Quicksort 2 - Sorting
  2. Discussions

Quicksort 2 - Sorting

  • h2100050009
     + 0 comments

    C solution (not mine but I got it from below took too long me to scroll ) For a beginner like me who has just began data structures 2 weeks ago this question left me scratching my mind for past 2 hours T-T

    #include <stdio.h>
#include <stdlib.h>

void quickSort(int *ar, int size)
{
    if(size > 1){
        int temp, pivot = ar[0], ub = size-1;
        for(int i = size-1; i >= 0; --i){
            if(ar[i] >= pivot){
                temp = ar[i];
                int j = i;
                while(j < ub){//Variation of Insertion Sorting
                    ar[j] = ar[j+1];
                    ++j;
                }
                ar[ub--] = temp;
            }
        }
        ++ub;
        quickSort(ar, ub);
        quickSort(ar+ub+1, size-ub-1);
    
        //Output
        for(int i = 0; i < size; ++i){
            printf("%d ", ar[i]);
        }
        printf("\n");
    }
}


int main(void)
{
    int N;
    scanf("%d", &N);
    int ar[N];
    
    for(int i = 0; i < N; i++){
        scanf("%d", &ar[i]); 
    }
    
    quickSort(ar, N);
    
    return 0;
}