Skip to main content

Selection Sort

/**
    Program Name: Selection Sort

    Description: This Program sort a given array elements, using Selection
                   Sort Algorithm

    Author:  Tauqirul Haque
       
*/

#include <conio.h>
#include <stdio.h>

#define MAX 5


void selectionSort(int *, int );
void display(int *);


void main()
{
    int array[MAX] = { 35,56,23,11,46 };
   
    printf("\nThe Array Before Sortint .... \n");
    display(array);
   
    selectionSort(array,MAX);
   
    printf("\n\nThe Array After Sorting .. \n");
    display(array);
   
}


void selectionSort(int *array, int array_size)
{
  int i, j;
  int min, temp;

  for (i = 0; i < array_size-1; i++)
  {
    min = i;
    for (j = i+1; j < array_size; j++)
    {
      if (array[j] < array[min])
        min = j;
    }
    temp = array[i];
    array[i] = array[min];
    array[min] = temp;
  }
}


void display(int *array)
{
    int i;
    printf("\n");
   
    for(i=0;i<MAX;i++)
    {
        printf("%5d",array[i]);
    }
    printf("\n");
}

       
   
   
   
   

Comments

Popular posts from this blog

Singly Linked List

/**     Program Name: Singly Linked List     Description: This Program is for Implemeting Singly Linked List     Author:  Tauqirul Haque         */ struct Linklist {     int item;     struct Linklist *next; }; typedef struct Linklist node; void insertAtBeginning(node **); void createAppendNode(node **); void insertInMiddle(node **); void deleteNode(node **); void displayNode(node **); void countNode(node **);  void searchElement(node **); void reverse(node **); void main() {     node *head = NULL;     int choice = 0;     while(choice != 9)     {             printf("\n\t\t\t1. Add Node At The Beginning ");     printf("\n\t\t\t2. Insert Element in the Middle ");     printf("\n\t\t\t3. Append New Node "); ...

BUBBLE SORT

/**     Program Name: BUBBLE SORT     Description: This Program sorts a Given Array in Ascending Order     Author:  Tauqirul Haque         */ #define SIZE 10 void bubbleSort(int data[SIZE]); void displayElement(int data[SIZE]); void main() {     int data[SIZE] = { 45,34,66,89,45,34,76,22,79, 12};         printf("\nThe Original Array Before Sorting ... ");     displayElement(data);         printf("\nArray After Sorting ... ");     bubbleSort(data);     displayElement(data);     } void displayElement(int data[SIZE]) {     int i;     for(i=0; i     {         printf("\nData[%d]  =  %d",i,data[i]);     }     printf("\n"); } void ...

FINDING FACTORIAL OF A NUMBER

/**     Program Name: FINDING FACTORIAL     Description: This Program finds a Factorial of a Given Number     Author:  Tauqirul Haque         */ long fact(long n); void main() {     long n;     printf("Enter N : ");     scanf("%d",&n);         if(n < 0)   //if its a neg number then changing the sign     {         n = -n;     }         printf("The fact of %ld  =  %ld \n\n",n,fact(n)); } long fact(long n) {     if(n==0 || n==1)     {         return 1;     }     else     {         return n*fact(n-1);     } }