Certification of Algorithm 271: Quickersort

@article{Blair1966CertificationOA,
  title={Certification of Algorithm 271: Quickersort},
  author={Charles R. Blair},
  journal={Commun. ACM},
  year={1966},
  volume={9},
  pages={354}
}
S u p p o s e t h e a r r a y A h a s n rows w i t h a n a v e r a g e of m n o n z e r o e l e m e n t s p e r row, i.e., t h e r e a re (mn) n o n z e r o e l e m e n t s in A . I n t h e w o r s t c o n c e i v a b l e case e a c h elem e n t of A w o u l d r e q u i r e a s e p a r a t e a p p l i c a t i o n of E X P A N D and each application of E X P A N D would involve the examination of the whole lnatrix, i.e., the number of operations would be of the order of (m n) 2. However there is… CONTINUE READING

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-2 of 2 extracted citations

Similar Papers

Loading similar papers…