Skip to search formSkip to main contentSkip to account menu

Selection sort

Known as: Selectsort, Bingo sort, Selectionsort 
In computer science, selection sort is a sorting algorithm, specifically an in-place comparison sort. It has O(n2) time complexity, making it… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
This work is to design an effective monitoring algorithm for healthcare services. By collecting physiological and physical… 
2015
2015
Sorting is a commonly used operation in field of computer science. Sorting is the process to arrange the data in either ascending… 
2012
2012
- Theories of Computer Sciences & Engineering nowadays are being only read than being designed and practiced. Hence in this paper… 
2009
2009
Sorting algorithms and the sorting itself is an important concept in computational field. In this research study, we are… 
2008
2008
Given an array with n elements, we want to rearrange them in ascending order. Sorting algorithms such as the Bubble, Insertion… 
2008
2008
Historically the dominant decision technology to make dispatch decisions was ¿rules¿ which involves the following basic… 
1993
1993
Abstract We propose a template library as a good representation of programming knowledge, and programming case studies as part of… 
1991
1991
Fully parallel methods for implementing the most significant relational algebra operators and data integrity checking in cellular… 
1989
1989
A current research topic in the area of relational databases is the design of systems based on the Non First Normal Form (NF2…