• Aucun résultat trouvé

# A general framework for the realistic analysis of sorting and searching algorithms. Application to some popular algorithms

N/A
N/A
Protected

Partager "A general framework for the realistic analysis of sorting and searching algorithms. Application to some popular algorithms"

Copied!
24
0
0

Texte intégral

(1)

## and searching algorithms. Application to some popularalgorithms

(2)
(3)

(4)

1

2

n

1

2

n

n

i

σ(i)

n

i

i

i

i

j

i

n

i

j

σ(1)

σ(2)

σ(n)

i

j

i

j

i

j

i

j

i

j

i

j

i

j

i

j

i

j

+

±

±

+

(5)

N

w

w

w

w

k

w

w

w

w

α,|α|=|w|, α<w

α

w

α,|α|=|w|, α≤w

α

w

w

w

k

wk

wk

wk

wk

wk

wk

wk

w

w

w

w

w

w

w

w

w

w

w

w∈Σ

w

ℓ≥0

[γ≥ℓ]

ℓ≥0

[γ=ℓ]

(6)

T

w∈Σ

Tw

1

n

1

2

n

i

i

[0,u[

[0,t[

[0,u[

[0,t[

[0,u[

[0,t[

[0,u[

[0,t[

[u,t[

[0,t[

[0,u[

]u,t[

i

n

−Z

k

Z

[0,u[

]u,t[

(7)

Z

Z

2

Z

Z

Z

Z

Z

Z

T

Z

Z

T

Z

n

Z

n

n

Z

T

w∈Σ

Tw

w

n k=2

k

T

w∈Σ

Tw

w

0

0

0

0

(8)

1

0

0

n k=1+σ0

k

n+1

ℜs=σ1

0

n+1

s

C2

2

1

1

2

0

n2

0

0

0

0

0

ρ

0

ρ

0

0

0

0

0

k

k

0

1

0

1

### More precisely, this means that

̟(s) is of polynomial growth on a family of horizontal linest

tk

### with

tk→ ∞, and on vertical linesℜ(s) =σ0−δ

δ< δ.

(9)

w

w

w

2

+

1

w∈Σ

w

w

sw

k

w∈Σk

w

w

sw

2

k

k→∞

w∈Σk

w

w

k→∞

k

|s=1

1

2

+

1

3

0

2

k·k

×

3

F ∈ F, F >

s

h(S)

Z1

0

F

(10)

0

0

i

j

0

0

w

w

0

0

0

n k=2

k

0

n k=3

k

0

(11)

0

0

0

0

0

0

0

0

0

0

0

0

0

0

ℓ≥0

w∈Σ

Tw

w∈Σ

Tw

w∈Σ

2w

w

r

p

0

r

r

r

p

p

p

r

r

ℓ≥0

r

−1 k=1

2

(12)

i

4

5

0

1

1−δ

1−δ

ρ

1−δ

k

6

4

κ2

InsSort

̟(s)/(s−

s

5

s

Bp

d(Bp

p

2

2p

−p) log2

−p)).

6

(13)

0

0

s−2

2

s−2

2

s−3

s−2

s−2

s−2

(a)

0

0

3

0

w∈Σ

w

s−1w

2

w∈Σ

bw

aw

w

s−2

w∈Σ

w

w

bw

aw

s−2

(b)

2

0

2

2

2

0

2

2

1

2

(c)

(14)

(15)

i

j

i

j

[x,y]

±

+

+

+

(16)

+

+

[i,j]

[i,j]

i

j

i

j

i

j

[i,j]

i

j

i

j

i

j

[1,j]

i

1

2

i−1

i

j

i

j

i

j

j

i

i

j

i

j

j

i

i

j

i

j

j

i

[i,j[

j

i

i

j

]i,j[

j

i

j

[i,j]

+

(17)

[1..i]

i

j

i

j

i

j

i

j

]i,j[

i

j

i

j

i

j

j

i

j

i

j

]i,j[

i

j

j

i

[i,j]

i

j

i

j

j

i

i

j

j

j

i

j

i

j

i

j

]i,j[

i

]i,j[

i

]i,j[

j

i

i

i

[1,i[

[1,i[

]i,j[

i

i

[j,n]

j

i

[1,i[

]i,j[

i

j

]i,j[

i

j

i

]i,j[

j

i

j

+

(18)

1

i

j

i

j

i

j

i

j

i

j

[1,i[

[1,i]

j

i

j

+

i

j

i

j

j

i

[1,i[

]i,j[

i

[1,j]

j

i

m

m

m

m

n

n

2

m

m

n

n

3

m

m

n−2

m

n−3

m

(19)

0

Z

0

m

m

0

i

i

j

0

1

[u,t[

2

[u,t[

1

2

2

[u,t[

2

2

[u,t[

[0,u[

3

[u,t[

2

3

1

[0,t[

2

[0,t[

1

2

2

[0,u[

2

[0,t[

2

2

m

m

m

n

n

m

m

m

m

m

n−2

m

m

n−3

m

2

[0,u[

3

]u,t[

2

Z

[0,u[

Z

3

]u,t[

3

3

0

(20)

s−2

w

sw

Q

I

I

I

s−3

w

ws−1

w∈Σ

w

ws−1

0

0

0

0

2

0

w∈Σ

w

w

w∈Σ

w<w

w

w

2

w∈Σ

2w

ℓ≥0

0

ℓ≥0

ℓ≥0

0

1

w∈Σ

w

w

w

1 0

1

### (2) .

Références

Documents relatifs

– exhibits a strong analogy between sorting and Pascal’s triangle, – allows to sort in lattices with quadratic complexity, and that it – is in fact a generalization of insertion

First (section Comparing inconsistent targets with inconsistent distractors during search initiation), by comparing guidance toward the inconsistently placed target to guidance

An extensive evaluation of the topological properties of the three different benchmarks demonstrate that LFR-BA and LFR-EV produce networks with lower average distance,

Then, in Section 6.5, we return to faithful sorting algorithms and describe how to mix the two approaches (Seidel’s one and the analysis of Section 6.3). Finally, we show in Section

This is why Sedgewick proposed in 1998 to analyze basic algorithms (sorting and searching) when dealing with words rather than with “atomic” keys; in this case, the realistic cost

L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des

It is shown a dependence graph of logical elements (valves) number on the input data number for the conveyor structures of the known (classical) and improved sorting devices by

Using an established three-step framework for fuzzification of an algorithm, the resulting new fuzzy algo- rithm goes beyond a simple conversion of data from raw to fuzzy