Recapitulare: Algoritmi: Varianta Cu Spaţiu Suplimentar de Memorie (Clasică)
Recapitulare: Algoritmi: Varianta Cu Spaţiu Suplimentar de Memorie (Clasică)
procedure interschimbare( A )
for each i in 0 to length(A) – 2
for each j in i + 1 to length(A) - 1
if A[i] > A[j] then
swap( A[i], A[j] )
end if
end for
end for
end procedure
Bubble-sort
procedure bubbleSort( A )
do
swapped = false
for each i in 1 to length(A) - 1
if A[i-1] > A[i] then
swap( A[i-1], A[i] )
swapped = true
end if
end for
while swapped
end procedure
Quicksort
function quicksort(array)
var list less, greater
if length(array) ≤ 1
return array
select and remove a pivot value pivot from array
for each x in array
if x ≤ pivot then append x to less
else append x to greater
return concatenate(quicksort(less), pivot, quicksort(greater))
2 variante cu interschimbare “pe loc”
j = choice(1…n)
if A(j) ==x print x; success
else print “esec”; failure
procedure Nsort(A)
array B
for i = 0 to n
B[i] = 0
for i = 0 to n
j = choice (1…n)
if B[j] != 0 then failure
B[j] = A[i]
for i = 0 to n - 1
if B[i] > B[i + 1] then failure
print B
success