Shell Sort
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
A
S
O
R
T
I
N
G
E
X
A
M
P
L
E
(h = 13)
A
E
O
R
T
I
N
G
E
X
A
M
P
L
S
(h = 4)
A
E
A
G
E
I
N
M
P
L
O
R
T
X
S
(h = 1)
A
A
E
E
G
I
L
M
N
O
P
R
S
T
X
h-sequence :.., 1093,364,121,40,13,4,1
Back to Sorting
Bubble Sort
for i :=
N downto 1
for j := 2 toi do
if a[j-1] > a[j]then
swap(a[j-1], a[j])
example:
6
3
3
2
2
1
3
6
2
3
1
2
9
2
6
1
3
3
2
7
1
5
5
5
7
1
5
6
6
6
1
5
7
7
7
7
5
9
9
9
9
9
T = N
2
/2 + (N
2
/2)*M
Back to Sorting