PureBasic Forums - English

Hello,

Could you please add to the PB help some informations about the sorting algorithm which is used?
I've heared that its QuickSort (not stable, inplace). And which element is used as pivot?
If its not the middle one: does it check at least if the elements are sorted already?

DarkDragon wrote:Could you please add to the PB help some informations about the sorting algorithm which is used?
I've heared that its QuickSort (not stable, inplace). And which element is used as pivot?
If its not the middle one: does it check at least if the elements are sorted already?

PureBasic uses QuickSort (unstable, in-place) for arrays and MergeSort for linked-lists (stable, in-place).