quick sort

-

Quick sort 




#include<stdio.h>

void quicksort(int a[],int lb,int ub);

int position(int a[],int lb,int ub);

void swap(int *a,int *b);

int main() 

{

    int n,i;

    printf("Enter number of elements you want to insert: ");

    scanf("%d",&n);

    int a[n];   

    printf("Enter the elements: ");

    for(i=0;i<n;i++) 

    {

        scanf("%d",&a[i]);

    }

    quicksort(a,0,n-1);

    printf("Sorted elements: ");

    for(i=0;i<n;i++) 

    {

        printf("%d ", a[i]);

    }

}

void quicksort(int a[],int lb,int ub) 

{

    if(lb<ub) 

    {

        int loc=position(a,lb,ub);

        quicksort(a,lb,loc-1);

        quicksort(a,loc+1,ub);

    }

}

int position(int a[],int lb,int ub) 

{

    int pivot=a[lb];

    int start=lb;

    int end=ub;

    while(start<end) 

    {

        while(a[start]<=pivot) 

        {

            start++;

        }

        while(a[end]>pivot) 

        {

            end--;

        }

        if(start<end) 

        {

            swap(&a[start],&a[end]);

        }

    }

    swap(&a[lb],&a[end]);

    return end;

}

void swap(int *a,int *b) 

{

    int temp=*a;

    *a=*b;

    *b=temp;

}

Comments

Post a Comment

Popular posts from this blog

SINGLE LINKED LIST by smd

-
#include <stdio.h> #include <stdlib.h> int count = 0; struct node {       int data;       struct node *next; }  *head = NULL, *newnode, *trav; void create_list() {       int value;       struct node *temp;       newnode = (struct node *)malloc(sizeof(struct node));       printf("Enter the value to be inserted: ");       scanf("%d", &value);       newnode->data = value;       newnode->next = NULL;       if (head == NULL) {           head = newnode;       } else {           temp = head;           while (temp->next != NULL)               temp = temp->next;           temp->next = newnode;       }       count++; } void insert_at_beg...
Read more

CLL by smd

-
#include <stdio.h> #include <stdlib.h> int count = 0; struct node {  int data; struct node *next; }; struct node *head = NULL, *newnode, *temp; void create_circle_linked_list(); void insert_at_begin(); void insert_at_end(); void insert_at_specific_point(); void delete_at_begin(); void delete_at_end(); void delete_at_specific_point(); void display(); void create_circle_linked_list()  {  int value; printf("Enter the value to be inserted: "); scanf("%d", &value); newnode = (struct node*)malloc(sizeof(struct node)); newnode->data = value; if (head == NULL)  {  head = newnode;  newnode->next = head;  } else  {  temp = head;  while (temp->next != head) temp = temp->next; temp->next = newnode; newnode->next = head;     }     count++; } void insert_at_begin()  { int value;  printf("Enter the value to be inserted: "); scanf("%d", &value); newnode = (struct node*)malloc(sizeof(str...
Read more

QUEUE USING ARRAYS by smd

-
 #include<stdio.h> #define size 100 int queue[size]; int front = -1, rear = -1; void enqueue(int x)  {     if (rear == size - 1)      {         printf("Queue is overflow\n");     } else      {         if (front == -1)          {             front = 0; // Initialize front if queue was empty         }         rear++;         queue[rear] = x;         printf("%d inserted sucessfully\n", x);     } } void dequeue()  {     if (front == -1 || front > rear)      {         printf("Queue is underflow\n");     } else      {         printf("%d deleted successfully\n", queue[front]);         front++;         if (front ...
Read more