Research Article
Efficient Parallel Sorting for Migrating Birds Optimization When Solving Machine-Part Cell Formation Problems
() Main Function QuickSort (, , ) is | () if then | () Partition (, low, high) | () QuickSort (, low, ) | () QuickSort (, + 1, high) | () end | () end | () Function Partition (, , ) is | () Object pivot = [low] | () = low | () for to high do | () if then | () Swap (, ) | () leftwall = leftwall + 1 | () end | () end | () Swap (, ) | () return leftwall | () end |
|