If certain integers are repeated often, use Radix Sort. If there are not many repetitions and a wide range of numbers, Merge Sort or Heap Sort are the way to go. Quick Sort, depending on how it is implemented, is usually the most versatile.
@gorgolyt It seems extremely staged, and I’m ok with that. We specialize for a reason. Also, I am a programmer and until this I didn’t know what bubble sort was (I mean, I’ve obviously thought of that method, but I didn’t know its name).
Most efficient way to store 1,000,000 32-bit integers?
Easy! Store it in an array and sort it using bubble sort, and save in a plain text file, with all entries separated by a pipe character. That would definitely be the most efficient scheme for storing all 1 million 32-bit integers.
the people who are screaming that this is patently fake may just be generally undereducated and hence be underestimating the possibility that he would know this.
i know nothing about programming but when i heard the question the first thing i thought was ‘bubble sort’.
considering his response was just a pretty vague way of mentioning the phrase ‘bubble sort’, and considering he’s an educated guy, i hardly find it impossible that this is genuine.
If certain integers are repeated often, use Radix Sort. If there are not many repetitions and a wide range of numbers, Merge Sort or Heap Sort are the way to go. Quick Sort, depending on how it is implemented, is usually the most versatile.
@cyanidesan Is it realy about .. “coolness” ?
@bob47910
“probably”
Taking shortcuts while typing makes you seem less educated than you probably are.
@Hermetiqa lol thats prbly right
damn, we can’t make fun of the American president anymore… stupid smart president…
@MissMidnitetoker i dont know, he kinda of looks familiar, i think i’ve seen him on tv running a nation somewhere… but i could be wrong
Google got owned ?
This was a setup. Political pandering to the geeks.
@MissMidnitetoker Who’s MissMidnitetoker?
@MissMidnitetoker Who’s MissMidnitetoker?
1: question
2: obama looks at his right reads answer , touch his eye and acts smart
Radix sort.
He is awesome!!!
….I didn’t understand the question? 8( …oh well. lol
@MyOverflow
Hahahaha. I love it.
Personally, I’d break it down into sets of 10,000, perform quick sort on each set, and merge sort it back together.
Who’s that black dude?
@gorgolyt It seems extremely staged, and I’m ok with that. We specialize for a reason. Also, I am a programmer and until this I didn’t know what bubble sort was (I mean, I’ve obviously thought of that method, but I didn’t know its name).
Most efficient way to store 1,000,000 32-bit integers?
Easy! Store it in an array and sort it using bubble sort, and save in a plain text file, with all entries separated by a pipe character. That would definitely be the most efficient scheme for storing all 1 million 32-bit integers.
@echoesintoeternity Quicksort.
Because, fuck it.
@Lewis1711 rapist?
@sam9524 parallel merge sort (if all you care about is the time), on-disk merge sort ( if u care abt memory and number of processors available)
LOL! whats the right answer?
the people who are screaming that this is patently fake may just be generally undereducated and hence be underestimating the possibility that he would know this.
i know nothing about programming but when i heard the question the first thing i thought was ‘bubble sort’.
considering his response was just a pretty vague way of mentioning the phrase ‘bubble sort’, and considering he’s an educated guy, i hardly find it impossible that this is genuine.
@westmerville What an excellent computer science related comment.
lmfao charming!?
HE fucking meant to be the anti christ is a charming guy!!