• No results found

SelectionSort

N/A
N/A
Protected

Academic year: 2020

Share "SelectionSort"

Copied!
52
0
0

Loading.... (view fulltext now)

Full text

(1)
(2)

Selection Sort Advantages

Easy to program

(3)

Selection Sort Disadvantages

(4)

Selection Sort Code

(5)

Selection Sort Example

(6)

2 8 5 1 3 4 6

i = 0

value = 2

j = 1

value = 8

k = 0

(7)

2 8 5 1 3 4 6

i = 0

value = 2

j = 1

value = 8

k = 0

value = 2

Compare 2 and 8

(8)

2 8 5 1 3 4 6

i = 0

value = 2

j = 2

value = 5

k = 0

value = 2

Compare 2 and 5

(9)

2 8 5 1 3 4 6

i = 0

value = 2

j = 3

value = 1

k = 0

value = 2

Compare 2 and 1

(10)

2 8 5 1 3 4 6

i = 0

value = 2

j = 4

value = 3

k = 3

value = 1

Compare 1 and 3

(11)

2 8 5 1 3 4 6

i = 0

value = 2

j = 5

value = 4

k = 3

value = 1

Compare 1 and 4

(12)

2 8 5 1 3 4 6

i = 0

value = 2

j = 6

value = 6

k = 3

value = 1

Compare 2 and 6

(13)

2 8 5 1 3 4 6

i = 0

value = 2

j = 7

value = N/A

k = 3

value = 1

j > list

Because i != k

(14)

1 8 5 2 3 4 6

i = 0

value = 1

j = 7

value = N/A

k = 3

value = 2

j > list

Because i != k

(15)

1 8 5 2 3 4 6

i = 0

value = 1

j = 7

value = N/A

k = 3

value = 2

(16)

1 8 5 2 3 4 6

i = 1

value = 8

j = 2

value = 5

16

k = 1

value = 8

Increment iReset j and k

(17)

1 8 5 2 3 4 6

i = 1

value = 8

j = 2

value = 5

k = 1

value = 8

Compare 8 and 5

(18)

1 8 5 2 3 4 6

i = 1

value = 8

j = 3

value = 2

k = 2

value = 5

Compare 5 and 2

(19)

1 8 5 2 3 4 6

i = 1

value = 8

j = 4

value = 3

k = 3

value = 2

Compare 2 and 3

(20)

1 8 5 2 3 4 6

i = 1

value = 8

j = 5

value = 4

k = 3

value = 2

Compare 2 and 4

(21)

1 8 5 2 3 4 6

i = 1

value = 8

j = 6

value = 6

k = 3

value = 2

Compare 2 and 6

(22)

1 8 5 2 3 4 6

i = 1

value = 8

j = 7

value = N/A

k = 3

value = 2

j > list

Because i != k

(23)

1 2 5 8 3 4 6

i = 1

value = 2

j = 7

value = N/A

k = 3

value = 8

j > list

Because i != k

(24)

1 2 5 8 3 4 6

i = 1

value = 2

j = 7

value = N/A

k = 3

value = 8

(25)

1 2 5 8 3 4 6

i = 2

value = 5

j = 3

value = 8

k = 2

value = 5

Increment iReset j and k

(26)

1 2 5 8 3 4 6

i = 2

value = 5

j = 3

value = 8

k = 2

value = 5

Compare 5 and 8

(27)

1 2 5 8 3 4 6

i = 2

value = 5

j = 4

value = 3

k = 2

value = 5

Compare 5 and 3

(28)

1 2 5 8 3 4 6

i = 2

value = 5

j = 5

value = 4

k = 4

value = 3

Compare 3 and 4

(29)

1 2 5 8 3 4 6

i = 2

value = 5

j = 6

value = 6

k = 4

value = 3

Compare 3 and 6

(30)

1 2 5 8 3 4 6

i = 2

value = 5

j = 7

value = N/A

k = 4

value = 3

j > list

Because i != k

(31)

1 2 3 8 5 4 6

i = 2

value = 3

j = 7

value = N/A

k = 4

value = 5

j > list

Because i != k

(32)

1 2 3 8 5 4 6

i = 2

value = 3

j = 7

value = N/A

k = 4

value = 5

(33)

1 2 3 8 5 4 6

i = 3

value = 8

j = 4

value = 5

k = 3

value = 8

Increment iReset j and k

(34)

1 2 3 8 5 4 6

i = 3

value = 8

j = 4

value = 5

k = 3

value = 8

Compare 8 and 5

(35)

1 2 3 8 5 4 6

i = 3

value = 8

j = 5

value = 4

k = 4

value = 5

Compare 5 and 4

(36)

1 2 3 8 5 4 6

i = 3

value = 8

j = 6

value = 6

k = 5

value = 4

Compare 4 and 6

(37)

1 2 3 8 5 4 6

i = 3

value = 8

j = 7

value = N/A

k = 5

value = 4

j > list

Because i != k

(38)

1 2 3 4 5 8 6

i = 3

value = 4

j = 7

value = N/A

k = 5

value = 8

j > list

Because i != k

(39)

1 2 3 4 5 8 6

i = 3

value = 4

j = 7

value = N/A

k = 5

value = 8

(40)

1 2 3 4 5 8 6

i = 4

value = 5

j = 5

value = 8

40

k = 4

value = 5

Increment iReset j and k

(41)

1 2 3 4 5 8 6

i = 4

value = 5

j = 5

value = 8

k = 4

value = 5

Compare 5 and 8

(42)

1 2 3 4 5 8 6

i = 4

value = 5

j = 6

value = 6

k = 4

value = 5

Compare 5 and 6

(43)

1 2 3 4 5 8 6

i = 4

value = 5

j = 7

value = N/A

k = 4

value = 5

j > list

(44)

1 2 3 4 5 8 6

i = 4

value = 5

j = 7

value = N/A

k = 4

value = 5

(45)

1 2 3 4 5 8 6

i = 5

value = 8

j = 6

value = 6

k = 5

value = 8

Increment iReset j and k

(46)

1 2 3 4 5 8 6

i = 5

value = 8

j = 6

value = 6

k = 5

value = 8

Compare 8 and 6

(47)

1 2 3 4 5 8 6

i = 5

value = 8

j = 7

value = N/A

k = 6

value = 6

j > list

Because i != k

(48)

1 2 3 4 5 6 8

i = 5

value = 6

j = 7

value = N/A

k = 6

value = 8

j > list

Because i != k

(49)

1 2 3 4 5 6 8

i = 5

value = 6

j = 7

value = N/A

k = 6

value = 8

(50)

1 2 3 4 5 6 8

i = 6

value = 8

j = 7

value = N/A

k = 6

value = 8

Increment i

(51)
(52)

Selection Sort

Video

References

Related documents

Patient imagines safe place and then gets childhood memory; if this is a good memory ask for opposite.. Pathways to

Although the thesis does not offer suggestions on how religious education ought to be organised in any given place, it does discuss possible advantages and disadvantages of the

Not Effective Depends on Signature database Can detect Distributed attacks, Real Time Detection Modification to the existing infrastructure No Extra Memory is

The only extra code required for this functionality is the @rpc() tag which is added to the interface declaration. Remote access to variables does not require any extra code.

Implement a void method called sortRecords to the RecordCollection class that does the following:. (a) Perform a selection sort to sort the records in

• And does require good controls information to inform management decision making.. Governing to Create

Insertion sort is a simple sorting algorithm that is relatively efficient for small lists and mostly-sorted lists, and often is used as part of more sophisticated algorithms.. It

The merge sort algorithm was also problematic for structural recursion since a split function does not produce lists that are structurally smaller.. However, it was still possible