File:Partition example.svg
Jump to navigation
Jump to search
Size of this PNG preview of this SVG file: 302 × 368 pixels. Other resolutions: 197 × 240 pixels | 394 × 480 pixels | 630 × 768 pixels | 840 × 1,024 pixels | 1,681 × 2,048 pixels.
Original file (SVG file, nominally 302 × 368 pixels, file size: 20 KB)
Captions
Captions
Add a one-line explanation of what this file represents
Summary[edit]
| Description |
English: It shows the in-place partition algorithm described at quicksort in action on a small list. The boxed element is the pivot element, blue elements are less or equal, and red elements are larger. The one thing this doesn't demonstrate that I wish it did is that sometimes two blue elements can be exchanged. |
| Date | 2 February 2006 (original upload date) |
| Source | No machine-readable source provided. Own work assumed (based on copyright claims)., Created by Derrick Coetzee in Adobe Illustrator, who releases all rights to this work. |
| Author | No machine-readable author provided. Dcoetzee assumed (based on copyright claims). |
| SVG development |  This trigonometry was created with Adobe Illustrator.  This trigonometry uses translateable embedded text. |
Licensing[edit]
|
I, the copyright holder of this work, release this work into the public domain. This applies worldwide. In some countries this may not be legally possible; if so: I grant anyone the right to use this work for any purpose, without any conditions, unless such conditions are required by law. |
File history
Click on a date/time to view the file as it appeared at that time.
| Date/Time | Thumbnail | Dimensions | User | Comment | |
|---|---|---|---|---|---|
| current | 11:01, 2 February 2006 | | 302 × 368 (20 KB) | Dcoetzee (talk | contribs) | Created by Derrick Coetzee in Adobe Illustrator, who releases all rights to this work. |
You cannot overwrite this file.
File usage on Commons
The following page uses this file:
File usage on other wikis
The following other wikis use this file:
- Usage on ar.wikipedia.org
- Usage on bg.wikipedia.org
- Usage on cs.wikipedia.org
- Usage on eo.wikipedia.org
- Usage on fa.wikipedia.org
- Usage on fr.wikipedia.org
- Usage on he.wikipedia.org
- Usage on he.wikibooks.org
- Usage on hu.wikipedia.org
- Usage on id.wikipedia.org
- Usage on it.wikipedia.org
- Algoritmo di ordinamento
- Teoria della complessità computazionale
- Pila (informatica)
- Array
- Bubble sort
- Insertion sort
- Quicksort
- Shaker sort
- Lista (informatica)
- Coda (informatica)
- Selection sort
- Shell sort
- Counting sort
- Merge sort
- Heapsort
- Radix sort
- O-grande
- Stupid sort
- Trippel sort
- Quickselect
- BFPRT
- Template:Ordinamento
- Comb sort
- Gnome sort
- Bucket sort
- Ordinamento delle frittelle
- Ordinamento topologico
- Odd-even sort
- Smoothsort
- Algoritmi di ordinamento adattivi
- Algoritmi di ordinamento comparativi
- Timsort
- Sleep sort
- Notazione L
- Pigeonhole sort
- Usage on ko.wikipedia.org
View more global usage of this file.
