| Title |
User |
Message |
Place |
Date Posted |
| Re: Re: Re: which sort? |
bbi5291 |
Actually there is one solution that uses mergesort. However, you have to be extremely clever with mergesort - this solution only sorts once (instead of t times), the entire list of scores. If you sort... |
ccc05s5 |
Feb 27, 2009 - 1:13:39 am UTC |
| Re: Different scores? |
hansonw1 |
The CCC official data had a bug in it, but your program passes that case now. (You'll get 3 more points!) |
ccc09s4 |
Feb 27, 2009 - 12:03:55 am UTC |
| Re: Re: which sort? |
hansonw1 |
All the < 0.2s solutions use a binary indexed tree. (not the same as a binary search tree!) However, all the other solutions use some sort of insertion sort. |
ccc05s5 |
Feb 26, 2009 - 11:46:26 pm UTC |
| Different scores? |
Saravannan |
When Hanson submitted my solution I got 0/50 but when I submit the same solution I get 10/50? |
ccc09s4 |
Feb 26, 2009 - 11:42:29 pm UTC |
| Re: Re: which sort? |
Bob |
Just a question of curiosity - did u use insertion sort? (yes, no, maybe so ...) |
ccc05s5 |
Feb 26, 2009 - 11:33:18 pm UTC |
| Post code |
bbi5291 |
Oh yeah, Hanson installed a script that allows you to use the tags [ code] and [ /code] (only without those spaces) in order to post code; it also automatically highlights keywords and other things. I... |
General |
Feb 26, 2009 - 10:48:19 pm UTC |
| Re: Whats fastest? |
bbi5291 |
They are all equally fast, but only if you use them in identical ways. While loops and repeat loops are essentially identical, the only difference being when the condition is checked (and checking tha... |
General |
Feb 26, 2009 - 10:40:51 pm UTC |
| Whats fastest? |
Bob |
For loop, while loop, or repeat loop |
General |
Feb 26, 2009 - 10:33:20 pm UTC |
| Re: CCC 2009 |
bbi5291 |
There is no time limit. |
General |
Feb 26, 2009 - 10:28:41 pm UTC |
| Re: Re: Just a reminder |
Saravannan |
I wasn't referring to you =P. Some people submitted almost working code to a plus b 2 a couple times. |
aplusb |
Feb 25, 2009 - 4:32:45 am UTC |
