ፍልልይ ኣብ መንጎ ክለሳታት «ኮምፒዩተር ሳይንስ»
Content deleted Content added
No edit summary |
No edit summary |
||
መስመር 32፦
function divide(left, right) {
i := left
j := right - 1
pivot := files[right]
መስመር 38፦
loop
loop while files[i] ≤ pivot and i < right
መስመር 44፦
end
loop while files[j] ≥ pivot and j > left
መስመር 52፦
if i ≤ j then swap files[i] with files[j]
while i ≤ j
if files[i] > pivot
Line 60 ⟶ 61:
end
return i
Line 75 ⟶ 76:
divider := divide (left, right)
if right-divider > divider-left
quicksort(left
// … እቶም ዝዕብይ ከኣ ይሰርዕ left := divider + 1
else
quicksort(divider + 1, right)
| |||