lol, don't be mad just because your method was comparable to selection sort and a poor form of recursion. Go read a book.

This post was edited by slapnutz2284 on Jun 1 2013 09:06pm

That's cute, you spent 20 minutes to find a picture because you had nothing intelligent to say. Come back when you know what you are doing. Good luck with your sorting hell78 and try not to get so butt hurt when someone gives better advice than you carte.

i was giving you the benefit of the doubt by assuming you were trolling. but i guess i was wrong. should i point out everything wrong that you said?


No.
1) with respect to comparison sorts, very often quicksort is faster than merge sort.
2) we can sort this faster than nlogn if we don't use a comparison sort


1) merge sort doesnt have to be recursive. any recursive algorithm can be written iteratively.
2) you seem to like selection sort since you mentioned that too. you can write that recursively. performance would be much worse, but then you'd like that even more since it's recursive.



are you reading the wrong post? mine looks nothing like selection sort. selection sort is O(n^2), mine is O(n+k) time with O(k) memory.



again, i think you were reading the wrong post. my solution doesnt have any recursion.



Eep has given better advice in other threads than your advice of merge sort. you might as well as just recommended bogo sort for shits and giggles

This post was edited by carteblanche on Jun 1 2013 09:33pm

I guess we now know the answer... and it wasn't trolling.

lol, actually, quicksort and mergesort both have the same average and best time of nlogn, however, mersort has a worst case of nlogn and quicksort has a worst case of n^2. Also, are you completely retarded? Go find Selection sort on wiki or something and read what you posted, it is selection sort. Selection sort: iterate through each index of the array and find its appropriate position in the array and place it there by comparing it to the other elements in the array. If you were talking about quick sort, you would have stated that you pick a pivot point, usually at random, and move the integers that are less than that to the left of the pivot and integers greater to the right and then repeat that process recursively on the subsets of data (the left and right partitions created). Go back to school and demand a refund.

I won't even bother arguing with this guy, so full of stupid.

lolololololololol.

i mean i kind of want to put you out of your misery, but you're providing us with so much entertainment.

This post was edited by irimi on Jun 1 2013 10:11pm

I love you too. Also shoutouts to radix sort, read about it last night.

Dichotomy sort will be far better for you, and easier to establish.

This post was edited by Bremen on Jun 3 2013 02:08am