::GameDeveloperPlayground::

Hello, i am GameDeveloperPlayground.

I am a Korean student and I post it for English practise.

I would appreciate pointing out grammar or typos.

In this posting in about select sort.

About Select Sort

Select sort is sorted is three ways.

1. Find the minimum value in a give array.

2. Replace the value with the value at the front of the array.

3. Replace the array with the first position subtracted in the same way.

Sorting Process

Let's start by randomly array numbers.

9 5 4 3 8 1 7

First find the lowest value in the unaligned array { 9 5 4 3 8 1 7}

It's 1. Replace the found value with the first value.

9 5 4 3 8 1 7 => 1 5 4 3 8 9 7

this one loop is over.

The second is to sort the array except for the first value, 

Find the lowest value 1 { 5 4 3 8 9 7 }. It's 3. Replace with the first array except 1

1 3 4 5 8 9 7

This is the way to go to the end.

(출처 : 위키백과 선택정렬)

Sample Code.

Implemented simply.

Algorithms analysis

Select sort is should be done entirely to get he minimum value. Therefore.

(n-1) + (n-2) + ..... + 2 + 1 = n(n-1)/2 

The time Complexity will be O(N²) with Big O notation.

Example.

(source:  위키백과 선택정렬 )

Video Example

( source: Youyube )

Thank you