smi256
|
|
« on: September 15, 2005, 07:28:03 PM » |
|
Programmers (from, but not limited to Mission) of various languages (Visual Basic, C, C++, C#, Java, Perl, anything and everything else) are welcomed to join this forum to discus and seek help about programming (including homework). General Forum Rules are short and simple Use the formatting buttons will let you use most of the formatting option
[code] [ /code] this is what I used to make this box.
--but you need to add the “New” to this line of code!-- [font=Courier New] [/font] using this makes some code look nicer
:sheep: Please ask your questions (about the forum and such) here in order to keep other threads on topic.[/size] The Sheep commands it so.
|
|
|
Logged
|
*was here
|
|
|
Mr.Slippery
|
|
« Reply #1 on: September 15, 2005, 08:30:03 PM » |
|
Hi, we are on a mission, are from Mission, and seek to get through this semester of programming with minimum headaches and maximum grade. If those are your goals also, then join up (register and log in) and have some fun. We can still use the file area at the Yahoo MC_Programmers group for shared data and code, but discussions may be easier in this forum. It's all voluntary, so do what you like. Just as long as you do SOMETHING. ttyl, Will :cool: btw, this forum does allow small files to be attached to messages, so if that's easier for you, then have at it. :sheep:
|
|
|
Logged
|
|
|
|
SS
|
|
« Reply #2 on: September 16, 2005, 03:25:18 PM » |
|
Welcome Mission people! :thumbs-up: Please feel free to spill over into the non-computer areas and contribute to the numerous thoughtful and intellectual discussions.
|
|
|
Logged
|
Peter 'SpectralShadows' Boughton, Seeker of Perfection, BPsite Sitelord.
Till shade is gone, till water is gone, into the Shadow with teeth bared, screaming defiance with the last breath, to spit in the Sightblinder's eye on the Last Day.
|
|
|
smi256
|
|
« Reply #3 on: September 16, 2005, 08:47:36 PM » |
|
REALLY?! WHERE?! :unsure: At this point I'd like to suggest that the people that are just joining to post and possibly one of those threads will start "thoughtful and intellectual discussions". HW (something more serious) Due: Sep 20 Bubble Sort: 100 1,000 10,000Selection Sort: 100 1,000 10,000Merge Sort: (must be recursive) 100 1,000 10,000We need to give the amount of time it takes to sort these sets of elements (using the fast timer given by Mr. Slippery), and the number of comparisons also of each set of elements. All-n-all, we’ll end up with 6 run times and 6 number of comparisons, a printout of the 3 source codes along with a ‘before’ and ‘after’ test array (a small one) for each sort function to show that they work.
|
|
|
Logged
|
*was here
|
|
|
smi256
|
|
« Reply #4 on: September 20, 2005, 07:30:00 PM » |
|
I printed out the Source Code and did some screen captures (print screen) Like this I took it down <_< Too bad for you!!! :hmmm: oops, there's my name, owell I hate those who don't post, and I hate those who havn't signed up yet! :devil: :sheep:
|
|
« Last Edit: September 24, 2005, 06:04:12 AM by smi256 »
|
Logged
|
*was here
|
|
|
Mr.Slippery
|
|
« Reply #5 on: September 21, 2005, 01:44:32 AM » |
|
Smi256, Hmmm, I got about 120,000 comparisons in the 10,000 element Merge Sort algorithm. That's about twice your figure.
where did u put ur comparison counter? I put mine after splitting the arrays into 2 pieces, then I counted the comparisons in the for loop.
-Slip
|
|
|
Logged
|
|
|
|
matt_the_shark
|
|
« Reply #6 on: September 21, 2005, 02:27:23 AM » |
|
oops, there's my name, owell OMG I'M GONNA BOMB YOUR HOUSE NOW PETER!!!!
|
|
|
Logged
|
|
|
|
smi256
|
|
« Reply #7 on: September 21, 2005, 07:01:48 AM » |
|
oops, there's my name, owell OMG I'M GONNA BOMB YOUR HOUSE NOW PETER!!!! :mellow: :huh: :blink: terrorist terrorist!! Home Land Security, get off your stupid asses and arrest that man!!! [edit] Slip, ya I think I put my counter in the wrong place I think...I'll post my code if people want me to.
|
|
« Last Edit: September 21, 2005, 07:03:10 AM by smi256 »
|
Logged
|
*was here
|
|
|
RipperRoo
|
|
« Reply #8 on: September 21, 2005, 02:57:09 PM » |
|
Why does everyone on here have the name Peter? Get off it, its mine. What does this thingy actually do btw?
|
|
|
Logged
|
"How could you be intimidated by a woman who had told you in dead seriousness that there were one hundred and seven different kisses, and ninety-three ways to touch a man's face with your hand?" --Min-- "Ohh my feet are getting hotter than a flame grilled otte
|
|
|
SS
|
|
« Reply #9 on: September 21, 2005, 06:01:34 PM » |
|
I had the name first! :angry:
What it's doing is sorting random numbers into order.
|
|
|
Logged
|
Peter 'SpectralShadows' Boughton, Seeker of Perfection, BPsite Sitelord.
Till shade is gone, till water is gone, into the Shadow with teeth bared, screaming defiance with the last breath, to spit in the Sightblinder's eye on the Last Day.
|
|
|
mole
|
|
« Reply #10 on: September 21, 2005, 06:05:45 PM » |
|
numerous thoughtful and intellectual discussions LOL youve made my day
|
|
|
Logged
|
Yiff Hunter says: and the last question do u get a sudden eye twicth and shudder wen i say :
CLEAN? RipperRoo says: yes Yiff Hunter says: rite ive declared u imorally peasant like
|
|
|
Hornet
|
|
« Reply #11 on: September 21, 2005, 10:07:22 PM » |
|
Please feel free to spill over into the non-computer areas and contribute to the numerous thoughtful and intellectual discussions. He does enjoy his little joke. On topic, is there anyone else here, apart from those who've already posted, who are programmatically inclined? And which languages?
|
|
« Last Edit: September 21, 2005, 10:07:43 PM by Hornet »
|
Logged
|
In the fridge! By the cheese! Waggle waggle!
Money isn't the solution to life's problems, but it can usually buy it.
|
|
|
smi256
|
|
« Reply #12 on: September 22, 2005, 06:44:04 AM » |
|
JAVA[/size] We went over: While, Do while, Logic operators, Switch, Formating, and how to draw Rectangles and Ovals.. HW #2 Pg161 #4.2 I guess she really did want us to do it ^.^;;; #3 Pg228 #5.17 out put should look something like this: Item# cost per item Qnty Cost 1 $2.98 2 $5.96 3 $9.98 1 $9.98 ------------------------------------------------------- Grand Total: $15.94
Can I die yet? I'm going to read ahead to learn more GUI :blink: hehe, that sounds funny
|
|
|
Logged
|
*was here
|
|
|
smi256
|
|
« Reply #13 on: September 24, 2005, 06:01:02 AM » |
|
Advanced C[/size]
I did the salesman problem…I think :blink: … I didn’t do it the brut force way though, which makes me think that it’s not going to be correct when there are a lot of cities :cry:
I’m now asking for a hint (or two, or three, or four, oh hell, just give me the answer!) How do you do a depth-first-search? I mean, I know how it works… but how the hell do you code something like that? The “distances” between the “cities” are stored in a 2D array. :sheep:
|
|
|
Logged
|
*was here
|
|
|
Mr.Slippery
|
|
« Reply #14 on: September 27, 2005, 01:37:44 AM » |
|
That's impressive Smi, <_<
You can test if it works properly by making the city list very small, like 4 locations, and then seeing if your algorithm works for that quantity.
Btw, I hope this homework isn't due tomorrow. otherwise, i'm hosed.
Could you bring your DM book to class?
-Slip
|
|
|
Logged
|
|
|
|
|