Professional Documents
Culture Documents
Introduction To Data
Introduction To Data
Science
Introduction to Data
Static
dynamic
spatial
Temporal
Text
media
Element: 8l!:
Quality: Fixed
Color: Light-Blue. Silver Day: Saturday
Ruler: Uranys, Satyrn
Greatest Overall Compatibility: J.&Q,
Lucky Numbers: 4, 7, 11, 22 , 29 gjttarlys
Date range: January 20 - F ebruary_jjl
AQUARIUS TRAITS
•?
p d - 2 0 1 8 0 8 2 •• ••z i p
Indrani Sen, MCA, MPhil Compuer Science
Census Data
NASA satellites imagery - terabytes of data per day
Weather and Climate Data
Rivers, Farms, ecological impact
Medical Imaging
Qufcl<sort (sometimes called partlt,lon-exchange sort) is an efficient sorting algorlthm.serving as a systematic method for placing the elements of an array In order. Developed by
Tony Hoarein 1959PIand publ shed in 1961,£21it is still a commonly used algorithm for sorting.When implemented well. it can be about two or three times raster thanits main
competitors,merge sort and
heapsort.[3J{oonmtd.c o1Yf
Oulc l<sort s a comparison sort, meaning that It can sort items of any type ror wtiich a "less-than" relation (formally, a total order) ts defined. In efficientimplementations it Is not a
stat>le sort , meaning that me relative order of equal sortItems is not preserved.
Ouicl<sort can operate in-place on an array, requiring small additional amounts of memory to perform the sorting. It s very similar to selection sort , except that it does not always
choose worst-case partition.
Mathematical analysis of qulcl<sort shov.'S that.on average. the algorithm takes O(nlog n) comparisons to sort nItems. In the worst case. 1t makes O(n2) comparisons.though this
behavior Is rare.
Contents (hide)
1H story
2Algorithm
2.1 Lomuto part t on scheme
2.2 Hoare partition scheme
2.3 Implementationissues 2.3.1 Choice of pvot
2.3.2 Repeated elements