One other note: there's a better way to calculate the highest number in an array:
Code:int x, high = 0; for(x = 0; x < max; x ++) { if(array[x] > array[high]) high = x; } // now high is the highest element
One other note: there's a better way to calculate the highest number in an array:
Code:int x, high = 0; for(x = 0; x < max; x ++) { if(array[x] > array[high]) high = x; } // now high is the highest element
dwk
Seek and ye shall find. quaere et invenies.
"Simplicity does not precede complexity, but follows it." -- Alan Perlis
"Testing can only prove the presence of bugs, not their absence." -- Edsger Dijkstra
"The only real mistake is the one from which we learn nothing." -- John Powell
Other boards: DaniWeb, TPS
Unofficial Wiki FAQ: cpwiki.sf.net
My website: http://dwks.theprogrammingsite.com/
Projects: codeform, xuni, atlantis, nort, etc.