Uncategorized – cvmath.club

Ալգորիթմներ

procedure max($a_1,a_2,…,a_n$: integers)

max:= $a_1$

for i :=2 to n

if max <$a_i$ then max:= $a_i$

return max{max is the largest element}

procedure linear search(x: integer, $a_1,a_2,…,a_n$: distinct integers)

i :=1

while (i ≤ n and $x\ne a_i$)

i := i +1

if $i ≤ n$ then location:= i

else location:=0

return location{location is the subscript of the term that equals x, or is 0 if x is not found}

procedure binary search (x: integer, $a_1,a_2,…,a_n:$ increasing integers)

i :=1{i is left endpoint of search interval}

j := n{j is right endpoint of search interval}

while i<j

m :=$\lfloor(i +j)/2 \rfloor $

if x>$a_m$ then i := m+1

else j := m

if x = $a_i$ then location:= i

else location:=0

return location{location is the subscript i of the term ai equal to x, or 0 if x is not found

procedure bubblesort($a_1,…,a_n$ : real numbers with $n ≥2$)

for i :=1 to n−1

for j :=1 to n−i

if $a_j >a_{j+1}$ then interchange $a_j$ and $a_{j+1}$

{$a_1,…,a_n$ is in increasing order}

procedure insertion sort$(a_1,a_2,…,a_n$: real numbers with $n ≥2$)

for j :=2 to n

i :=1

while $a_j >a_i$

i := i +1

m := $a_j$

for k :=0 to j −i −1

$a_{j−k} := a_{j−k−1}$

$a_i := m$

{$a_1,…,a_n$ is in increasing order}