Kessells_SR@cc.curtin.edu.au (11/05/90)
Hi, Can someone please tell me where I can find a proof for the fact that sorting has a lower bound of OMEGA(n log n). Has it been proven? Who was the first to prove this? Thanks in advance Paul Vowles Computing Science Department Curtin University of Technology Western Australia ------------------------------------------------------------------------------- Internet: TKESSELLS01@cc.curtin.edu.au ACSnet: TKESSELLS01@cc.cut.oz.au Bitnet: TKESSELLS01%cc.curtin.edu.au@cunyvm.bitnet UUCP: uunet!munnari.oz!cc.curtin.edu.au!TKESSELLS01 -------------------------------------------------------------------------------