理学 排序算法 释 quicksort 快速排序 一种排序算法，任选一个元素作为主元（pivot），把其余元素与主元比较后分成大小两个部分，再对每个部分继续如法炮制，直到全部元素排好序为止。又称分区交换排序。
quicksort 快速排序算法
理论计算机科学 算法设计与分析 释文 quicksort 快速排序
- Pure discount bond
- pure discrete spectrum
- pure electric vehicles
- pure electron event
- pure electronic shutter
- Pure Endeavour
- pure ensemble
- pure equation
- pure existence proof
- pure extension
- pure factorial design
- pure fermentation
- Pure Food and Drug Act of 1906
- pure forest
- pure gauge
- pure geometry
- pure gravity anomaly
- pure ideal
- pure imaginary
- pure imaginary number
- pure impressionistic sound
- pure infinitesimal geometry
- pure inseparable extension
- pure inseparable morphism
- pure integer programming