No one has voted on any posts yet. Votes from other community members are used to determine a member's reputation amongst their peers.
6 Posted Topics
 | O(1) == constant. Infarction was right tho, we need more info... All we know from your explanation, is that the list appears to be ordered from 1..n. and that u want to be able to investigate the number held at a position in the array. True? a single comparison at …  |
| | i did a GIS project for my final softwre eng. project. check out ALOV.org. it's open source and u can embed it in php code. think real estate. or even something like google maps. you could get census data free from your geography dept. professors,(they love CS majors to talk … |
| | try this logic... You know a word isn't a palindrome if it's an odd number of characters. For even numbered words, use 2 iterators on your string, start one at the beginning, and one at the end. Moving the two iterators towards each other and comparing the values at each … |
 | Infarction is dead on. go read dykstras writings at the university of texas for what a computer scientist does. [url]http://www.cs.utexas.edu/users/EWD/[/url] |
| | Re: Algorithm help this algorithm doesn't handle the case of non-integer entry, hence the question #4 and "wingding". not robust. also, notice that it doesn't handle the case of entering 49. u need <= 49, as it is now, when u enter 49 all it will say is "how did u do?" same … |
| | Hi all, I have a problem with my implementation of a unix shell, I'm hoping someone can point me straight... In my shell program, I collect and parse a user's entry from the command line and dump it into an array like `getopts()`. I then call `fork()` and `execvp(args[0],args)` (`(i.e. … |
The End.