Alright, it's time for some programming trick questions
-
-
Replying to @qntm
What's the fastest way to sort a jumbled array containing the integers 1 to N?
3 replies 6 retweets 12 likes -
Replying to @qntm
Answer: just repopulate the array with new integers from 1 to N. Running time is O(N)
4 replies 2 retweets 23 likes -
Replying to @qntm
What's the fastest way to test whether a 32-bit integer is a perfect number?
2 replies 3 retweets 7 likes -
Replying to @qntm
Answer: `return x == 6 || x == 28 || x == 496 || x == 8128 || x = 33550336;` For 64-bit integers you need only three additional terms
3 replies 0 retweets 20 likes -
Replying to @qntm
Too easy.
1 reply 0 retweets 0 likes
Replying to @noop_noob
Did me telling you up front that it was a trick question help, do you think
4:41 PM - 17 Jun 2017
1 reply
0 retweets
1 like
-
-
Replying to @qntm
Probably.
0 replies 0 retweets 0 likesThanks. Twitter will use this to make your timeline better. UndoUndo
-
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.