关于“在微机上以极小内存实现快速分类的方法”的改进

AN IMPROVED QUICK SORTING ALGORITHM WITH MINIMAL STORAGE ON A MICROCOMPUTER

本文介绍了一种比文献更加快速的在微机上以极小内存实现对N 个元素进行快速分类的方法。对四种分类方法进行了实验比较。文末给出了实现本算法的BASIC 程序。

This paper presents an improved quick sorting algorithm of N elementswith minimal storage on a microcomputer.An empirical result of four methods iscompared each other.A program to implement this sorting algorithm is given.