• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Design & Analysis of Optimized Selection Sort Algorithm”, IJEC-IJENS Volume 11 Issue 01, 2011. The graph shows that optimized selection is far better than its competitor algorithms of the same order (0)

by Sultanullah Jadoon, Salman Faiz, Salim ur Rehman, Hamid Jan
Venue:of O (n 2 ). 115002-3838 IJECS-IJENS © April 2011 IJENS
Add To MetaCart

Tools

Sorted by:
Results 1 - 1 of 1

Optimized Selection Sort Algorithm is faster than Insertion Sort Algorithm: a Comparative Study

by Sultanullah Jadoon, Salman Faiz Solehria, Mubashir Qayum
"... ABSTRACT – Optimized Selection Sort Algorithm is a new sorting algorithm that has been developed to address the shortcomings of the current popular sorting algorithms. The goal of this research is to perform an extensive empirical analysis of Optimized Selection Sort against Selection Sort and Inser ..."
Abstract - Add to MetaCart
ABSTRACT – Optimized Selection Sort Algorithm is a new sorting algorithm that has been developed to address the shortcomings of the current popular sorting algorithms. The goal of this research is to perform an extensive empirical analysis of Optimized Selection Sort against Selection Sort and Insertion Sort Algorithms. The results proved that Optimized Selection Sort is much more efficient than Selection Sort Algorithm; Furthermore analysis supports the fact that Optimized Selection Sort is better than Insertion Sort
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University