選択ソート
1. Selection sortIn computer science, a Selection sort is a sorting algorithm, specifically an in-place comparison sort. It has O(n) time complexity, making it inefficient on large lists, and generally performs worse than the similar insertion sort. Selection sort is noted for its simplicity, and also has performance advantages over more complicated algorithms in certain situations, particularly where auxiliary memory is limited.
Read “Selection sort” on English Wikipedia
Read “選択ソート” on Japanese Wikipedia
Read “Selection sort” on DBpedia
Read “Selection sort” on English Wikipedia
Read “選択ソート” on Japanese Wikipedia
Read “Selection sort” on DBpedia
Discussions
Log in to talk about this word.