24 bytes

  • HOME
  • Algorithms
    blue
  • Bubble Sort
  • Bucket Sort
  • Insertion Sort
  • Selection Sort
  • Merge Sort
  • Quick Sort
  • Heap Sort
  • Counting Sort
  • Stack
  • Queue
  • Double Linked List
  • Binary Search Tree
  • Towers OF Hanoi

  • Java Programs
    green bullet
  • Download RMI Calculator
  • Download file
  • Clock applet
  • File Upload
  • JDOM Parser
  • Client server
  • Udp Client server
  • Sudoku Solver

  • System Programming
  • Newtwork Sniffer
  • Good Links
    green bullet
  • Free Source Code
  • Top Coder
  • Code Project
  • Learn Today
  • Concept
  • Intresting Programs
    green bullet
  • Prime Number
  • GCD Euclids
  • Permutations


  • Google
     
    Web 24bytes.com



    Download Selection Sort in C++
    #include <iostream.h>
    
    void selectionSort(int *array,int length)//selection sort function 
    {
    	int i,j,min,minat;
    	for(i=0;i<(length-1);i++)
    	{
    		minat=i;
    		min=array[i];
    
          for(j=i+1;j<(length);j++) //select the min of the rest of array
    	  {
    		  if(min>array[j])   //ascending order for descending reverse
    		  {
    			  minat=j;  //the position of the min element 
    			  min=array[j];
    		  }
    	  }
    	  int temp=array[i] ;
    	  array[i]=array[minat];  //swap 
    	  array[minat]=temp;
    
    		
    	}
    
    }
    
    
    
    void printElements(int *array,int length) //print array elements
    {
    	int i=0;
    	for(i=0;i<10;i++)
        cout<<array[i]<<endl;
    }
    
    
    void main()
    {
    
    	int a[]={9,6,5,23,2,6,2,7,1,8};   // array to sort 
        selectionSort(a,10);                 //call to selection sort  
    	printElements(a,10);               // print elements 
    }
    
    
    . original template by Aran Down.