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)

Related topics

Related topics

39 relations
AP Computer Science AAlgorithmic efficiencyArray data structureBubble sort

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Metodología para medir el impacto de las NIIF en los profesionales de las áreas contables y financieras de las PYMES
This research proposes a methodology to measure the impact of International Financial Reporting Standards (IFRS) accounting… 
2013
2013
Beacon- and Schema-Based Method for Recognizing Algorithms from Students’ Source Code.
In this paper, we present a method for recognizing algorithms from students' programming submissions coded in Java. The method is… 
2012
2012
A Novel Sorting Algorithm and Comparison with Bubble sort and Insertion sort
Sort is an algorithm that arranges all elements of an array, orderly. Sorting Technique is frequently used in a large variety of… 
2009
2009
A new friends sort algorithm
Sorting algorithms and the sorting itself is an important concept in computational field. In this research study, we are… 
2008
2008
Merge Sort Algorithm
Given an array with n elements, we want to rearrange them in ascending order. Sorting algorithms such as the Bubble, Insertion… 
2008
2008
Technology that upsets the social order — a paradigm shift in assigning lots to tools in a wafer fabricator — the transition from rules to optimization
Historically the dominant decision technology to make dispatch decisions was ¿rules¿ which involves the following basic… 
2004
2004
Adaptive multiple fault detection and alarm processing for loop system with probabilistic network
This paper presents the fault detection and alarm processing in loop system with fault detection system (FDS). FDS consists of… 
1996
1996
On the termination of recursive algorithms in pure first-order functional languages with monomorphic inductive data types
We present a new method for verifying the termination of recursively defined functions written in pure first-order functional… 
1993
1993
Supporting Pascal Programming with an On-Line Template Library and Case Studies
Abstract We propose a template library as a good representation of programming knowledge, and programming case studies as part of… 
1989
1989
Duplicate Detection and Deletion in the Extended NF² Data Model
A current research topic in the area of relational databases is the design of systems based on the Non First Normal Form (NF2… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)