 |  |  |  |  |  |  |  |
how to writ this kind of algorithem
 |
a) Write an algorithm that finds both the smallest and largest numbers in a list of n numbers
and calculate its complexity T(n).
b) Write an algorithm that finds both the smallest and largest numbers in a list of n numbers
and with complexity T(n) is at most about (1.5)n comparisons.
and calculate its complexity T(n).
b) Write an algorithm that finds both the smallest and largest numbers in a list of n numbers
and with complexity T(n) is at most about (1.5)n comparisons.
•
•
Join Date: Jun 2005
Posts: 2,047
Reputation: 
Solved Threads: 139
No. Gently caress you. Do your own homework.
All my posts may be redistributed under the GNU Free Documentation License.
•
•
Join Date: Jul 2005
Posts: 1,681
Reputation: 
Solved Threads: 264
I think this will work. Let's change it up a bit. Say I put some numbers in a paper bag, gave you the paper bag and said take the numbers and tell me what the biggest and smallest number in the bag was. One way you could do it is to sort the numbers (however you wanted to do that) and report the extremes. But can you think of another way you could determine the largest and smallest without sorting the numbers first? If so, try adapting that approach to your problem.
|
Similar Threads
- What kind of music (Geeks' Lounge)
- What kind of motherboard do i nee? AGP or PCI-E (Monitors, Displays and Video Cards)
- All kind of banners with a low price (Site Layout and Usability)
- validation of some kind (C++)
Other Threads in the C Forum
- Previous Thread: How to view the code
- Next Thread: Query on Structures
| Thread Tools | Search this Thread |
You need to join our community in order to build your list of favorite forums. You can visit the forum index for a listing of all forums.
Related Forum Features
Latest C Posts
- Today's Posts
- Unanswered Threads
* ansi api array arrays bash binarysearch calculate centimeter changingto char character convert copyanyfile copypdffile createcopyoffile createprocess() directory dynamic execv fflush file floatingpointvalidation fork forloop frequency function getlasterror getlogicaldrivestrin givemetehcodez grade graphics gtkgcurlcompiling gtkwinlinux hardware highest histogram homework i/o ide inches infiniteloop initialization input intmain() iso keyboard km license linked linkedlist linux list looping loopinsideloop. lowest matrix microsoft mysql oddnumber open opendocumentformat openwebfoundation pdf pointer pointers posix power program programming pyramidusingturboccodes read recursion recv recvblocked repetition reversing scanf scheduling segmentationfault send shape single socketprogramming stack standard strchr string suggestions test testautomation threads unix urboc user variable whythiscodecausesegmentationfault win32api windows.h windowsapi
