Skip to main content

Selection Sort using C program


#include<stdio.h>
#include<conio.h>
void main()
{int i,j,a[5],temp;
 clrscr();
 printf("enter elements :\n");
 for(i=0;i<5;i++)
 {
 scanf("%d",&a[i]);
 }
 for(i=0;i<=4;i++)
 {for(j=i+1;j<=4;j++)
  {if(a[i]>a[j])
   {temp=a[i];
    a[i]=a[j];
    a[j]=temp;
   }
  }
 }
 printf("\n\n After sorting \n");
 for(i=0;i<5;i++)
 {printf(" %d",a[i]);
 }
 getch();
 }

Comments

Popular posts from this blog

Use Case Diagram for Online Book Store

Online Movie Ticket Booking Sequence Diagram

Linear search & Binary search using Template

Write a program to search an element from a list. Give user the option to perform Linear or Binary search. Use Template functions. #include<iostream> using namespace std; template <class T> void Lsearch(T *a, T item, int n) { int z=0; for(int i=0;i<n;i++) { if(a[i]== item) { z=1; cout<<"\n Item found at position = "<<i+1<<"\n\n"; } else if(z!=1) { z=0; } } if(z==0) cout<<"\n Item not found in the list\n\n"; } template <class T> void Bsearch(T *a, T item, int n) { int beg=0,end=n-1; int mid=beg+end/2; while((a[mid]!=item) && (n>0)) { if(item>a[mid]) beg=mid; else end=mid; mid=(beg+end)/2; n--; } if(a[mid]==item) cout<<"\n Item found at position = "<<mid+1<<"\n\n"; else cout<<"\n Item not found in the list\n\n"; } void main() { int iarr[10] = {2,42,56,86,87,99,323,546,767,886};