## Results of Comment Search

Search:    Place:    Show:

Title User Message Date Posted
Score Ties Kieran Based on the definition of r, am I right in saying that if the scores are 100, 100 and 100, all scores are of rank 1? Or are tied scores ranked based on date added? Nov 22, 2011 - 1:23:05 am UTC
Re: Re: Re: Re: Re: which sort? bbi5291 I used mergesort (it was not an original thought however, credit must go to Sean Henderson, former PEG leader.) However, that code was inadvertently deleted, so you can't see it anymore. Feb 28, 2009 - 12:05:26 am UTC
Re: Re: Re: Re: which sort? dAedaL Who used mergesort? From what I can see everyone who solved it used insertion or BIT no? Feb 27, 2009 - 2:14:06 am UTC
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... Feb 27, 2009 - 1:13:39 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. Feb 26, 2009 - 11:46:26 pm UTC
Re: Re: which sort? Bob Just a question of curiosity - did u use insertion sort? (yes, no, maybe so ...) Feb 26, 2009 - 11:33:18 pm UTC
Why does my program run faster, AND slower? Bob WHen i changed the variables to real (etc.), my program worked for most of the testcases faster - but more of the testcases overall became TLE. Why? Feb 25, 2009 - 12:22:16 am UTC
Re: help? bbi5291 Nice that you learned how to code a binary search tree. So, Jacob tried the same, and he also got only 90/100. The last test case is specially designed to be worst-case in terms of runtime, so you pro... Feb 07, 2009 - 4:43:54 pm UTC
help? Daniel is there any other way to speed up my binary search tree? Feb 07, 2009 - 3:44:42 pm UTC
Re: Hardware Failure? hansonw1 This means you went wayyy out of bounds. Jan 21, 2009 - 12:00:45 am UTC