Quick Sort is another example of a divide and conquer algorithm. It requires the identification of an arbitrary pivot point (ideally somewhere near the centre) around which the other values of the array are ordered relatively. This pivot creates a partition in the array. To the left of the pivot we aim to place the values lower than it and to the right the higher values.
-
Notifications
You must be signed in to change notification settings - Fork 1
Quick Sort is another example of a divide and conquer algorithm. It requires the identification of an arbitrary pivot point (ideally somewhere near the centre) around which the other values of the array are ordered relatively. This pivot creates a partition in the array. To the left of the pivot we aim to place the values lower than it and to th…
smmcgrath/Quick-Sort
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Quick Sort is another example of a divide and conquer algorithm. It requires the identification of an arbitrary pivot point (ideally somewhere near the centre) around which the other values of the array are ordered relatively. This pivot creates a partition in the array. To the left of the pivot we aim to place the values lower than it and to th…
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published