Quicksort


Abrar Rakin
Computer Science Student at University of Waterloo

Quicksort is a divide-and-conquer algorithm. It works by selecting a 'pivot' element from the array and partitioning the other elements into two sub-arrays, according to whether they are less than or greater than the pivot. For this reason, it is sometimes called partition-exchange sort. The sub-arrays are then sorted recursively. This can be done in-place, requiring small additional amounts of memory to perform the sorting.

The following shows the visualization in p5.js:




The code for the above visualization is given below.



To know more :

//en.wikipedia.org/wiki/quicksort

Discover more

GAME OF LIFE

The Game of Life is a zero-player game, meaning that its evolution is determined by its initial state, requiring no further input. One interacts with the Game of Life by creating an initial configuration and observing how it evolves.

3D SINE WAVE

A sine wave is a geometric waveform that oscillates (moves up, down or side-to-side) periodically, and is defined by the function y = sin x.

PHYLLOTAXIS

Phyllotaxis or phyllotaxy is the arrangement of leaves on a plant stem. Phyllotactic spirals form a distinctive class of patterns in nature. The algorithm behind the phyllotaxy is intriguing.