heap sort

-

 HEAP SORT 





#include <stdio.h>

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

    int temp = *a;

    *a = *b;

    *b = temp;

}

void heapify(int a[], int n, int i) {

    int largest = i; 

    int left = 2 * i + 1;

    int right = 2 * i + 2; 

    if (left < n && a[left] > a[largest])

        largest = left;

    if (right < n && a[right] > a[largest])

        largest = right;

    if (largest != i) {

        swap(&a[i], &a[largest]);

        heapify(a, n, largest);

    }

}

void heapSort(int a[], int n) {

    int i;

    for (i = n / 2 - 1; i >= 0; i--)

        heapify(a, n, i);

    for (i = n - 1; i >= 0; i--) {

        swap(&a[0], &a[i]);

        heapify(a, i, 0);

    }

}

int main() {

    int n, i;

    printf("Enter number of elements: ");

    scanf("%d", &n);

    int a[n];

    printf("Enter %d elements:\n", n);

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

{

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

}

    heapSort(a, n);

    printf("\nSorted array: ");

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

{

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

}

    printf("\n");

    return 0;

}







OUTPUT:

Enter number of elements: 5

Enter 5 elements:

8 43 24 13 1

Sorted array: 1 8 13 24 43 


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

-
PROGRAM #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(si...
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