@Goronzrus the first thing that came to mind for me was mergesort, which is O(n*logn). He said most efficient, not fastest. Radix sort with a million 32-bit integers would take up a considerable amount of memory, no?
I suppose it depends on which is more important.... for google I guess memory isn't an issue.
@FangFiftyFive The merge sort also has a lot of space overhead too, since it needs to store copies of the list. I'd say a quick sort is best as a general case sorting algorithm, it's often faster than other comparison sorts and normally requires much less space. Unless you have other requirements, such as sorting multiple records, if you want a predictable run time, then quick sort is often a good choice.
For a generalized list I'd say shuffle the list then use a Quicksort, but if the list was already *almost* sorted (which isn't uncommon) then actually a bubble sort may not be a bad idea.
@FangFiftyFive Not necessarily. If the list is very short then a bubble sort has a smaller overhead than a merge or quick. Or if you were using the algorithm in an embedded device where every mW of power mattered and you were only sorting short lists, then again a bubble sort may be better. Choosing the right sort depends a lot on what you are using it for.
@MrHaithamE There is a psychological need for a single leading figure in the less reflected and thus major part of society. It's the way evolution made us work. The concept of congresses (or better parliaments) who govern millions of individuals is a very recent development, which our brains - at least in their uneducated form - aren't well accustomed to. So if you want the majority to follow, and not riot (i.e. find local alphas in small clusters), you need to present a leader.
@Xealous Bucket is not for sorting.. It's just a way of storing data(associative array). If I were asked this question I would reply with a question: Are the integers randomly positioned in the set or do they follow a pattern? If the integers are randomly positioned in the set then I would go with any nlogn algorithm.
is the answer a merging technique where you divide the integers into 2 seperate lists sort them and then merge the two because in reality it would take Theeta n log n if you were to express it in engineering terms. Im guessing theres better ways but im a noob.
Yeah, like merge-sort. Divide and conquer. You partition the list and sort each half by recursively partition them and merge back together. Runs in nlogn time.
YOU CAN FOOL SOME OF THE PEOPLE SOME OF THE TIME- AND SOME OF THE PEOPLE ALL THE TIME BUT YOU CAN'T FOOL ALL THE PEOPLE ALL THE TIME- President Abraham Lincoln meant these words for to Obama who has deceived America not only with his FORGED birth certificate but by hiding his CRIMINAL past- GOOGLE "LARRY SINCLAIR" if U want to see the past Obama has hidden-
@HLGDecoy quantum bogo sort is still Θ(n) though isn't it? Because you still have to iterate through the list to check if it's sorted. Then it's really no faster than radix or counting sort which are O(n).
"Computer Science Question " ???? No. just something HE made up when HE is not a computer scientist.
The computer science question "whats the most efficient way to sort a large list of integers ? ". because a real computer scientist would know it didn't matter to specify the exact size of each, or overall size...
@isilder Actually the size of the list does matter. For small lists, insertion sort is in practice faster than any of the nlogn sorts. For larger lists, quicksort is fastest in the average (but not worst) case. For really large lists (too big to fit in memory), mergesort is best. For a million 32 bit integers, quicksort would usually be fastest.
@SalamanderBSC It can even be done in O(n) if you have lots of integers and they are non-unique, as long as the integers are in RAM (access/write times O(1)). Radix sort achieves this.
@bondservant4Him Merge sort is best at sorting when n is large(i.e. 1 million), for a very small n(10 or so) other sort methods may actually complete quicker than a merge sort on the same set of numbers.
Can I jerk off about time complexity too? We should use bucket sort which is O(n) which we can do since 32-bit integer is of finite size and hence has finite buckets.
@bondservant4Him Merge sort, invented by John von Neumann and used extensively by Google (time complexity O(nlogn), as opposed to bubble sort's O(n^2))
Make a sieve that increases size allowance as time folds; meaning send each entry to a independent process area; so a million or so simultaneous processes; then increase size of the size allowance send it through again. The idea is that the list would reassemble increasingly sorted. But there would need to be measures to accelerate the process, like the sum weight of all entries and the method of compensate for the size allowance that reveals no sortier(better sorted) list.
@Ther3tr0 bubble sort is the simplest sort algorithm, but the most inefficient one. to sort a million integers, that would take 1000,000,000,000 iterations. but if you use other methods like merge sort or quick sort that would be of the order 6000000 iterations.
@KafshakTashtak it actually depends on the way that the bubble sort is implemented. As it turns out, the parallel implemetation of the bubble is one of the most efficient ones.
@xxStardaSxx I don't know about parallel method of implementation, but generally between sort algorithms bubble sort is the worst. But in that case I think other sort would work great in parallel too.
What's obama doing at google? I'm sure he'd have no trouble finding a job at a GM dealership rotating tires. GM would love to have him, after all the bail out money that he gave them..
We need to word correctly in Computer "Science". What the heck is a Software or Hardware? What the heck is an audio device? Isn't any speaker on a Computer an Audio "Device"? What the heck is a Driver?
Bubble sort isn't quite the worst sorting technique. The worst one I know of it the Random Sort. Basically you randomize the list and then check to see if it's in order. If not, randomize again and repeat until it's sorted properly.
Good, I like that you share this video, I wish success always Barack Obama gets asked a computer science question by Google CEO Eric Schmidt.
imegatrone 2 days ago
This has been flagged as spam show
I Really Like The Video From Your Barack Obama gets asked a computer science question by Google CEO Eric Schmidt.
kelekokerupuk 2 days ago
Damn Obama hating on bubble sort :/
friggindoc 1 week ago
I Love The Video It Can Increase My Knowledge Barack Obama gets asked a computer science question by Google CEO Eric Schmidt.
jhoenedu 2 weeks ago
Nice Video That You Share , So Very Nice Thanks You Barack Obama gets asked a computer science question by Google CEO Eric Schmidt.
croncong 2 weeks ago
I Really Like The Video From Your Barack Obama gets asked a computer science question by Google CEO Eric Schmidt.
fitnesus 2 weeks ago
Your Video Is Very Useful Sharing Barack Obama gets asked a computer science question by Google CEO Eric Schmidt.
lupabuatchannel 2 weeks ago
class president
{ int year;
}
psvm(String args[])
{ president Ron Paul= new president (2012);
}
... duh.
deathslayer101 3 weeks ago 9
@deathslayer101 //error = president Ron Paul
{ unrecognized command }
/system failure
/system failure
/system failure
Jayjon81 5 days ago 4
@Jayjon81 fuuuuuuuu.... dam mayan calendar ....
deathslayer101 5 days ago
Saw your own video like 100 intervals ...
motorcyclefairings01 3 weeks ago
is everyone reading this stuying programing or computer science?
rostyloco1 3 weeks ago
Radix sort, ofc.
TheFuturePoet 1 month ago
@TheFuturePoet Lol. That'd take up so much ram. You'd need an array from 0 to 2^31-1, But I suppose Google has plenty of RAM to spare.
fiend7777 3 weeks ago
@fiend7777
I believe you'd only need 2 arrays, both of length N, where one contains the input and the other is a temporary.
sciencectn 3 weeks ago
How one can alter movie clips so fantastic as you may do
gitguti 1 month ago
Saved to fav your entire tube channel and viewing it on a daily basis !!!
gitguti 1 month ago
As a final point not junk high quality video !!!
hatfieldlainall 1 month ago
I love your work.
please check out the trailer for the novel WIth These Eyes.
A global computer network serves as the tool by an agressor to track a journalist who is about to uncover the secret of Quantum Energy.
please give me a "Thumbs up" and subscribe if you like what you see.
peace and love
RyanKensington 1 month ago
You've done good job with all of these kinds of videos .
TurboBusinessPro 1 month ago
Remember to write about link to all your hub pages web page ...
acswaterproofing 1 month ago
lol awesome
memoivoila 1 month ago
Good film
howmuchforroof 1 month ago
Seriously many thanks for work .
OlleFayettev38 1 month ago
If I get married to You tube yt channel your own ...
nutridopolska 1 month ago
If this type of youtube channel is not really amazing I not really know what is !
BeverleyAvaloi256 1 month ago
nice question, lol. Obama is fun!
Brittanionf529 1 month ago
that was a great answer, the man didnt avoid the question but he deflected it by saying what wasnt the answer. genius i tell u
JChien6953 1 month ago
people hate the governement lol XD....why cant we all unite and be nice <3
mrkosilathi 1 month ago
Fuck u nwo scum
TrutherTube2012 1 month ago
Holy sh*t how do you guys know all the stuff?? Are you all computer science
Majors or something???
amrinder1994 1 month ago
i'd say 7zip lol
PoliticalBaffoon 1 month ago
"We got our spies in there" It's funny because it is true.. :p
arabsforever 1 month ago 12
@arabsforever I'd say Google has them right back. One hand watches the other.
FGN123 2 weeks ago
what a beast! so wish that he knew that himself aswell!
radix sort all the way
RaseshX 1 month ago
Comment removed
RaseshX 1 month ago
Radix sort fool
satshabadkhalsa 2 months ago
@satshabadkhalsa Quick sort will take more operations, but will run in less time as radix will have more cache misses. Try it :D
804df 1 month ago
cool!!
Spasatcom 2 months ago
reorder data out-of-place with each stage with a separate bit/digit reversal and O(N log N) storage algorithm.
MuonRay 2 months ago
Scripting:
Makes a person look intelligent, when it really makes them look trainable.
MuonRay 2 months ago
Quicksort has an efficiency of about O(n^1.2).
It's radix sort you fools, it has an efficiency of O(n).
Goronzrus 2 months ago
@Goronzrus the first thing that came to mind for me was mergesort, which is O(n*logn). He said most efficient, not fastest. Radix sort with a million 32-bit integers would take up a considerable amount of memory, no?
I suppose it depends on which is more important.... for google I guess memory isn't an issue.
Ok, you're right.
FangFiftyFive 2 months ago
Comment removed
h1gifford 2 months ago
This has been flagged as spam show
@FangFiftyFive The merge sort also has a lot of space overhead too, since it needs to store copies of the list. I'd say a quick sort is best as a general case sorting algorithm, it's often faster than other comparison sorts and normally requires much less space. Unless you have other requirements, such as sorting multiple records, if you want a predictable run time, then quick sort is often a good choice.
h1gifford 2 months ago
Quick sort I guess.
vava54own 2 months ago
For a generalized list I'd say shuffle the list then use a Quicksort, but if the list was already *almost* sorted (which isn't uncommon) then actually a bubble sort may not be a bad idea.
h1gifford 2 months ago
@h1gifford Bubble sort is always a bad idea unless you need to hack something quickly.
FangFiftyFive 2 months ago
@FangFiftyFive Not necessarily. If the list is very short then a bubble sort has a smaller overhead than a merge or quick. Or if you were using the algorithm in an embedded device where every mW of power mattered and you were only sorting short lists, then again a bubble sort may be better. Choosing the right sort depends a lot on what you are using it for.
h1gifford 2 months ago
Comment removed
crostas92 2 months ago
@h1gifford Just be glad he knew what bubble sort even is, comming from someone who hasn't studied computer science and stop playing the smartass.
crostas92 2 months ago
@h1gifford Besides, a million says it all --'
crostas92 2 months ago
Quicksort FTW/
SpunkySprawlz 2 months ago
Herman Cain could have actually answered this probably. (He has a masters in computer science).
itsbackfliptime 2 months ago
@itsbackfliptime
Are you serious? I call bullshit!!
Reido2828 2 months ago
Binary search?
reid300 2 months ago
@reid300 that's a search algorithm not a sort
bebookspacebuzz 2 months ago
@bebookspacebuzz sorry put into binary tree*
reid300 2 months ago
@reid300 Only if it's self-balancing...
FangFiftyFive 2 months ago
Hmm, I'm thinking radix sort.
Tangent128 2 months ago
awesome
N4Paulina647 2 months ago
This has been flagged as spam show
watched and subbed immediatelly
gitguti 2 months ago
interesting talk!
optikasia 2 months ago
nice vid
pqMelissa284 2 months ago
This has been flagged as spam show
Fantastic!!! Really want considerably more: )
seamlessgutterss 2 months ago
Obama makes no decisions, the congress make the decisions, there is really no NEED for a president.
MrHaithamE 2 months ago
@MrHaithamE There is a psychological need for a single leading figure in the less reflected and thus major part of society. It's the way evolution made us work. The concept of congresses (or better parliaments) who govern millions of individuals is a very recent development, which our brains - at least in their uneducated form - aren't well accustomed to. So if you want the majority to follow, and not riot (i.e. find local alphas in small clusters), you need to present a leader.
DerCrossi 2 months ago
is the answer something like heap/quick/merge or is it something else like bucket?
Xealous 2 months ago
@Xealous Bucket is not for sorting.. It's just a way of storing data(associative array). If I were asked this question I would reply with a question: Are the integers randomly positioned in the set or do they follow a pattern? If the integers are randomly positioned in the set then I would go with any nlogn algorithm.
pithikoulis 2 months ago
with an aray
blanchjoey2 2 months ago
loop?
array?
sonicdash7 3 months ago
is the answer a merging technique where you divide the integers into 2 seperate lists sort them and then merge the two because in reality it would take Theeta n log n if you were to express it in engineering terms. Im guessing theres better ways but im a noob.
galloan 3 months ago
@galloan
Yeah, like merge-sort. Divide and conquer. You partition the list and sort each half by recursively partition them and merge back together. Runs in nlogn time.
mastersgta1 2 months ago
why is everyone laughing
animalnt 3 months ago
more evidence to suggest that Obama has an ever-present earpiece which other use to pitch him lines.
PrivationProductions 3 months ago
scripted
TheTroyes1 3 months ago 30
Quick sort go!
Hardy123Zhao 3 months ago
@Hardy123Zhao Only when the number of integers is low, For higher number of integers use heap sort.
jasmeet89 3 months ago
This comment has received too many negative votes show
OBAMA SUCKS!
shoemakerleve9 3 months ago
Always Heapify
samsam1029 3 months ago
President Obama nice with computer science
walidsediqi1 3 months ago
This has been flagged as spam show
YOU CAN FOOL SOME OF THE PEOPLE SOME OF THE TIME- AND SOME OF THE PEOPLE ALL THE TIME BUT YOU CAN'T FOOL ALL THE PEOPLE ALL THE TIME- President Abraham Lincoln meant these words for to Obama who has deceived America not only with his FORGED birth certificate but by hiding his CRIMINAL past- GOOGLE "LARRY SINCLAIR" if U want to see the past Obama has hidden-
HarryOrielly 3 months ago
he's so cool lol
xxbluejay21 3 months ago
obviously the correct answer is quantum bogo sort
HLGDecoy 3 months ago
@HLGDecoy quantum bogo sort is still Θ(n) though isn't it? Because you still have to iterate through the list to check if it's sorted. Then it's really no faster than radix or counting sort which are O(n).
j3ff86 3 months ago
For some weird reason this reminds me of a interview with justin bieber, the way he looks into the audience the way he sits.... am I weird? XD
Agathon31 3 months ago
The google guy is sooo autistic.
boredmonkey29 3 months ago
@boredmonkey29 What makes you say that...
xVerbati 3 months ago
alphabetically...
kirfdog 3 months ago
radix sort :)
NeshaTheBest 4 months ago
@NeshaTheBest I'll second that
Magnenator 3 months ago
I'm going with merge sort.
treysmithorama 4 months ago
answer is quicksort
yucelye90 4 months ago
Depends on what the numbers are :)
fortysixfish 4 months ago
well, if the array was already sorted, Bubble Sort would be a great option (O(n) time). Otherwise, merge sort.
cyberferretX 4 months ago
He clearly should have used Quantum Bozosort.
Intredasting 4 months ago
"Computer Science Question " ???? No. just something HE made up when HE is not a computer scientist.
The computer science question "whats the most efficient way to sort a large list of integers ? ". because a real computer scientist would know it didn't matter to specify the exact size of each, or overall size...
isilder 4 months ago
@isilder Actually the size of the list does matter. For small lists, insertion sort is in practice faster than any of the nlogn sorts. For larger lists, quicksort is fastest in the average (but not worst) case. For really large lists (too big to fit in memory), mergesort is best. For a million 32 bit integers, quicksort would usually be fastest.
kered13 4 months ago
@isilder
Actually, it does matter. If you are using arbitrary precision integers (or large strings), you probably want as few comparisons as possible.
Then there are some other things which can help how you sort.
If the integers are unique (that is, they only appear once) and in a relatively small enough range, it can be done in O(n) with a bit array.
Additionally, if you have a truly enormous number of things to sort, you'd probably want to use polyphase merge sort.
SalamanderBSC 4 months ago
@SalamanderBSC It can even be done in O(n) if you have lots of integers and they are non-unique, as long as the integers are in RAM (access/write times O(1)). Radix sort achieves this.
cemperable 4 months ago
radix ftw
theeyeofthestorms 4 months ago
I am from Serbia (that far) and still I can tel that the President is sitting on the right-hand side :)
popacrovac 4 months ago
interand
{ 3*3.14;}
Bubble sort.
24CharlieHorse 4 months ago
Why are you bubble sorting the government's finances?
legacymate 4 months ago
Barack, you totally bubble sorted the Iraq War after you became President.
Kamyanets 4 months ago
@Kamyanets He bubble sorted the Iraq War? No wonder it took so long to get out of there
ccricers 1 month ago
Bubble sort would be good O(n) if the integers were already sorted! if the integers were nearly sorted, insertion sort would probably do well.
idoljaysmith 4 months ago
@idoljaysmith Bubble sort runs O(n^2). I'd use merge sort
BlackNine313 4 months ago
@BlackNine313 yes but the best case is O(n)
idoljaysmith 4 months ago
bucketsort.
robinbuster 4 months ago
Nobama!
T3RRABYT3 4 months ago
in retro. obamas whole personality shtick is see through and lame
dvzqz87 4 months ago
lol @ obama turning his head to look at the teleprompter. Learn to peripheral vision?
elitestar 4 months ago
@bondservant4Him Merge sort is best at sorting when n is large(i.e. 1 million), for a very small n(10 or so) other sort methods may actually complete quicker than a merge sort on the same set of numbers.
wassat676 4 months ago
Why did you change your mind about Iraq, Obama? D:
You threw so many exceptions in your campaign promises and failed to catch them.
ccricers 4 months ago 73
@ccricers Lmao!
prestigeScript 3 months ago
@ccricers I luled so hard.
h4s4t4n 3 months ago
@ccricers
Because when it comes to governing Obama is an actual pragmatist. You should be happy America didn't elect and ideologue like Bush.
tubub 3 months ago 12
@tubub hes put us 1.4 trillion deeper in debt, ill take bush again please...
spike51234 1 month ago
@tubub Yeah, pragmatic wars, pragmatic bailouts, pragmatic inflation...
aloisjanicek 4 weeks ago
Can I jerk off about time complexity too? We should use bucket sort which is O(n) which we can do since 32-bit integer is of finite size and hence has finite buckets.
bishnu13 4 months ago
he only said the wrong way of going about it, which algorithm would be the right one??
bondservant4Him 5 months ago
@bondservant4Him Merge sort, invented by John von Neumann and used extensively by Google (time complexity O(nlogn), as opposed to bubble sort's O(n^2))
mkolod 4 months ago
@bondservant4Him Merge or quick sorts most likely.
travelholic91 4 months ago
The black man is rapping at 0:58
MightyGerm96 5 months ago
Even the Prez is getting educated on Software Engineering :) For those interested in a deep discussion, check out MemoryLeakDMS channel
MemoryLeakDMS 5 months ago
if you need to 'sort' world problems, then get out of everything America!
Excelsoft 5 months ago
LOLOLOL OH MY GOD OBAMA AT GOOGLE AND HE ANSWERED A COMPUTER QUESTION LOLOLOL SO AWESOME BEST PRESIDEANT EVAR LUL XD
Get the fuck out.
Metal404Head 5 months ago
Make a sieve that increases size allowance as time folds; meaning send each entry to a independent process area; so a million or so simultaneous processes; then increase size of the size allowance send it through again. The idea is that the list would reassemble increasingly sorted. But there would need to be measures to accelerate the process, like the sum weight of all entries and the method of compensate for the size allowance that reveals no sortier(better sorted) list.
osheaad 5 months ago
if there are 2 items to be sorted, than bubble sort it ok.
the0th 5 months ago
LOL @ the mention fo the iraq war at the end.
he changed his mind a year in.
johnny45irish 5 months ago
This guy is such a good bull shitter then again every president is. Nothing but a figure head.
numba1netsfan 5 months ago
Wow. I can't believe President Obama knows about sorting techniques.
johnverco 5 months ago 49
@johnverco Too bad he doesnt know much of anything else.
Soap360 4 months ago
@Soap360 or so you say
qpSubZeroqp 4 months ago
@qpSubZeroqp Or so I do say.
Soap360 4 months ago
@johnverco he doesn't, he knew he was going to be asked that question and was told that answer
andrew2372 3 months ago
@andrew2372 yes falsifying a qualifier question allows him to make conjecture on other things he is not qualified to make statements about.
circusboy90210 3 months ago
@johnverco did you watch the video? he doesn't
webmastertool 3 months ago
Didn't Schmidt notice the teleprompter?
Garbage in, garbage out.....in 2012
jamieblond1 5 months ago 2
I would have use quantum sort. ^^
meltingEyeballs 5 months ago 2
Good luck with bubble sort.... Quick sort is a way to go :D
TheGogind 5 months ago
If you didn't get it, know that there are 10 types of people in the world:
Those who understand binary and those who don't ;)
gumgl 5 months ago
I dont get it.
Ther3tr0 5 months ago
@Ther3tr0 bubble sort is the simplest sort algorithm, but the most inefficient one. to sort a million integers, that would take 1000,000,000,000 iterations. but if you use other methods like merge sort or quick sort that would be of the order 6000000 iterations.
KafshakTashtak 5 months ago
@KafshakTashtak potentially 1000,000,000,000 x) O(N^2) is a worst case scenario.
christophcooneyoff 5 months ago
@KafshakTashtak it actually depends on the way that the bubble sort is implemented. As it turns out, the parallel implemetation of the bubble is one of the most efficient ones.
xxStardaSxx 5 months ago
@xxStardaSxx I don't know about parallel method of implementation, but generally between sort algorithms bubble sort is the worst. But in that case I think other sort would work great in parallel too.
KafshakTashtak 5 months ago
OBAMA ALL THE WAY
JeaoLucius 5 months ago
Radix Sort FTW!
AirmanAJK 6 months ago
lool
Bunfire123 6 months ago
BUBBLE SORT FTW
CHAIRLEGSIFY 6 months ago
staged
ibarrettall 6 months ago
What's obama doing at google? I'm sure he'd have no trouble finding a job at a GM dealership rotating tires. GM would love to have him, after all the bail out money that he gave them..
studolf 6 months ago
@studolf look at the date, it was before he was president, so he was campaigning
SuperBlackChic 5 months ago 2
bubble sort is good thinking.
flowewritharoma 6 months ago
@flowewritharoma
He said NOT a bubble sort...
Ilikemustard 6 months ago 2
Comment removed
boarding5401 6 months ago
I like how in the end, the interviewer says that hes notible for his opposition to the iraq war.
but lmao, its almost 4 years AFTER HE WAS ELECTED, and we still have troops in afaganistan, iraq, and now lybia.
Hypocrite much.
ps: i dont like obama, so of course that makes me a racist.
minion6500 6 months ago
@minion6500 we don't have troops in Libya
Chunbiii 6 months ago
@Chunbiii no not troops, but we have spent nearly a trillion dollars bombing them
minion6500 6 months ago
There are only three types of comments on this video.
1) People laughing and enjoying the video
2) People having political discussions
3) Computer scientists trying to answer Eric Schmidt's question
MeBeMat 6 months ago 51
@MeBeMat I'm category 3. XD
LightningHexagon 6 months ago
@MeBeMat I like hammocks.
4) non sequitor smart ass answers...
sinistar99 4 months ago
@MeBeMat 1) and 2) and 3) are not exactly disjoint sets
ernie2111 4 months ago
We need to word correctly in Computer "Science". What the heck is a Software or Hardware? What the heck is an audio device? Isn't any speaker on a Computer an Audio "Device"? What the heck is a Driver?
heartlessvietboy 6 months ago
@SpellboundSolution @gnossticc you both have officially lost the internet. You can turn in your card at the Internet police office by Wednesday.
spoonninja123 6 months ago
Comment removed
SpellboundSolution 6 months ago
wait who asked the question? The google CEO is who? The guy who asked the question or the guy telling obama the question
webmastertool 6 months ago
That's it?
ThatPsychopathGuy2 6 months ago
Here the question when are you gonna do something any good.oh oh i got a quetion FUUUUUUUUUUCCCCCCKKKKKKK YYYYYYYYOOOOUUUUUUUUU
MEGABOXINGKID 7 months ago
The real question is: Will it blend ?
Kshade45K 7 months ago 7
Let's see Obama use the Bubble Sort Algorithm to sort the following objectives from least to most important
1) putting citizens in prison for smoking pot
2) preventing another financial / housing bubble (may be too late, but what if..)
Oh, wait... I kinda already gave away the answer.
I still doubt he'll get it.
mphello 7 months ago
Bubble sort isn't quite the worst sorting technique. The worst one I know of it the Random Sort. Basically you randomize the list and then check to see if it's in order. If not, randomize again and repeat until it's sorted properly.
pragma1700 7 months ago 9