Vokal12
Member
Hello,
i habe a table with 2000 unsorted elements.i will like to sort them with an input.
For example:
n is my input
Tab:[9,0,3,2,1,4,6,5,8,7]
if n:=3
1. step: [0,1,2]
2. step:[0,1,2,3,4,5]
3. step:[0,1,2,3,4,5,6,7,8]
4. step:[0,1,2,3,4,5,6,7,8,9]
if n:=4
1. step: [0,1,2,4]
2. step:[0,1,2,3,4,5,6,7,8]
3. step:[0,1,2,3,4,5,6,7,8,9]
i have already sort algorithms(Bubble,Insertion,...) but now i want to optimize my algorithm with this input.
why can i do that?
Thks
Vokal12
i habe a table with 2000 unsorted elements.i will like to sort them with an input.
For example:
n is my input
Tab:[9,0,3,2,1,4,6,5,8,7]
if n:=3
1. step: [0,1,2]
2. step:[0,1,2,3,4,5]
3. step:[0,1,2,3,4,5,6,7,8]
4. step:[0,1,2,3,4,5,6,7,8,9]
if n:=4
1. step: [0,1,2,4]
2. step:[0,1,2,3,4,5,6,7,8]
3. step:[0,1,2,3,4,5,6,7,8,9]
i have already sort algorithms(Bubble,Insertion,...) but now i want to optimize my algorithm with this input.
why can i do that?
Thks
Vokal12
