Breaking News: Grepper is joining You.com. Read the official announcement!

QuickSort c

Add Answer

Win_IT answered on October 11, 2020 Popularity 9/10 Helpfulness 5/10

answer QuickSort c

related quick sort c

related quicksort in c

QuickSort c

Comment

#include <stdio.h> 
int partition(int array[] , int low , int high){
        int pivot = array[high] ;
        int i = (low - 1) ;
        for(int j = low ; j  < high ; ++j ){
                if(array[j] <= pivot){
                        ++i ;
                        int temp = array[i] ;
                        array[i] = array[j] ;
                        array[j] = temp ;
                }
        }
        int temp = array[i + 1] ;
        array[i + 1] = array[high] ;
        array[high] = temp ;
        return (i + 1);
}

void QuickSort(int *array , int low , int high){
        if (low < high){
                int Pi = patition(array , low , high) ;
                QuickSort(array , low , Pi -1 ) ;
                QuickSort(array , Pi + 1 , high) ;
        }
}

int main(int argc  , char *argv[]) {
 	int arr[7] = { 8, 7, 2, 1, 0, 9, 6 } ;
    QuickSort(arr , 0 , sizeof(arr) / sizeof(arr[0]) - 1);
}

Popularity 9/10 Helpfulness 5/10 Language c

Source: Grepper

Tags: c quicksort

Link to this answer
Share Copy Link

Contributed on Aug 20 2023

Win_IT

0 Answers Avg Quality 2/10

Closely Related Answers

quick sort c

Comment

-1

#include<stdio.h>
#define MAX 100

int insert_array(int a[]) {
  int n, i;
  printf("Quanti elementi?: ");
  scanf("%d", &n);

  for (i=0; i<n; i++) {
  	 printf("elemento %d: ", i);
  	    scanf("%d", &a[i]);
  }
  return(n);
}

void stampa_array(int a[], int n) {
  int i;
  for (i=0; i<n; i++) {
    printf("%d ", a[i]);
  }
  printf("\n");
  return;
}

void quicksort(int a[MAX],int primo,int ultimo){
   int i, j, pivot, temp;
/*pivot -- inizialmente il pivot è il primo elemento
primo e ultimo sono le due variabili che servono per scorrere l'array
*/
   if(primo<ultimo){
      pivot=primo;
      i=primo;
      j=ultimo;     
      
      while(i<j){
         while(a[i]<=a[pivot]&&i<ultimo)
            i++;
         while(a[j]>a[pivot])
            j--;
         if(i<j){   
            temp=a[i];
            a[i]=a[j];
            a[j]=temp;
         }
      }

      temp=a[pivot];
      a[pivot]=a[j];
      a[j]=temp;
      quicksort(a,primo,j-1);
      quicksort(a,j+1,ultimo);
   }
}

int main(){
   int n, a[MAX],i;
   n = insert_array(a);
   printf("Array iniziale: "); 
   stampa_array(a,n);    
   quicksort(a,0,n-1);
   printf("Array ordinato con quick-sort: ");
   stampa_array(a,n);
   return 0;
}

Popularity 10/10 Helpfulness 4/10 Language c

Source: www.codingcreativo.it

Tags: c

Link to this answer
Share Copy Link

Contributed on Apr 19 2022

Easy Eland

0 Answers Avg Quality 2/10

quicksort in c

Comment

int cmpfunc (const void * a, const void * b) {
   return ( *(int*)a - *(int*)b );
}

Popularity 10/10 Helpfulness 1/10 Language whatever

Source: Grepper

Tags: c

Link to this answer
Share Copy Link

Contributed on Oct 11 2020

ruthless__spryzon

0 Answers Avg Quality 2/10

QuickSort c

Contents

More Related Answers

QuickSort c

Closely Related Answers

quick sort c

quicksort in c

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.