I have taken this problem from Programming Pearls by Jon Bentley. "In early 1960s Vick Vyosstosky was approached by one programmer to run a program of finding a transpose of a matrix of size 4000 by 4000 on a tape drive.Each record has the same format and consists of dozen of bytes.Total time to run a program woulod be 50 hours!.Vick reduced the run time to 30 minutes.How? This is what is appears in the book! [ November 07, 2003: Message edited by: Capablanca Kepler ]
Howard Kushner<br />IBM Certified Enterprise Developer - WebSphere Studio Application Developer V5.0<br />IBM Certified Advanced System Administrator - WebSphere Application Server V5.0<br />IBM Certified Solution Developer - Web Services with WebSphere Studio V5.1<br /><a href="http://www.amazon.com/exec/obidos/tg/detail/-/1931182108/" target="_blank" rel="nofollow">Developing J2EE Applications with WebSphere Studio</a> my Certification Study Guide for IBM Test 287
Joined: Mar 13, 2003
I don't know!Was Pearl there in early 60s?(OK, I was able to solve that partially,I saw the solution,Author says Vick sorted the data first by column and then by row and then some system utility.) Anybody who used to work on Tape drives in those time?Please share your thoughts!