FilesExpand file tree

 master

/

selection-sort.cpp

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

35 lines (24 loc) · 1.15 KB

 master

/

selection-sort.cpp

Copy path

Top

File metadata and controls

• Code
• Blame

35 lines (24 loc) · 1.15 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

#include <stdio.h>

//Selection Sort;

//Best Case: O = (n²); Worst Case = 0 = (n²); because it will always run the whole array in order to sort it out;

//Array gets divided into two portions = one the left side things are always sorted, on the right side: always unsorted;

int main () {

int a[] = {9, 3, 2, 1, 0, 4, 6, 7, 5};

int lenght = 10; //hard coded lenght of the array for the sake of simplicity

//the first step of the selection sort is to assume that the index we are looking at at any given time is the lowest possible in the sequence

for(int i = 0; i < lenght - 1; i++){ //lenght - 1 because the last element of the array will sort itself through the process;

int min = i; //meaning that the index we are iterating over will be handing on the minimum possible value;

for(int j = i + 1; j < lenght; j++){

if(a[j] < a[min]) { //condition to check if the minimum index is actually the minimum in the unsorted portion

min = j;

}

if(min != i) { //condition to check if a swap is necessary;

int temp = a[i];

a[i] = a[min];

a[min] = temp;

}

}

printf("\na[%d] = %d", i, a[i]);

}

return 0;

}