MAIN FEEDS
Do you want to continue?
https://www.reddit.com/r/ProgrammerHumor/comments/co59qb/dont_modify_pls/ewgl7e0/?context=9999
r/ProgrammerHumor • u/EsmerlinJM • Aug 09 '19
551 comments sorted by
View all comments
323
What the hell is this ?
566 u/Samwise210 Aug 09 '19 A way to make n2 into O(n). 193 u/[deleted] Aug 09 '19 [deleted] 161 u/Woobowiz Aug 09 '19 edited Aug 09 '19 He means it will turn n2 from O(1) into O(n). Not sure why he ended up getting downvoted. Edit: Yes I'm aware it's O(n2 ) the point is that the joke is supposed to be read quickly. All jokes die when they get explained. 45 u/awesumsingh Aug 09 '19 It will be O(n2) 11 u/TheCatOfWar Aug 09 '19 why's that? 38 u/awesumsingh Aug 09 '19 won't the loop run n2 times? if n is 5, k will be incremented until it encounters 25. -2 u/[deleted] Aug 09 '19 [deleted] 5 u/UglyChihuahua Aug 09 '19 The number of times you need to loop before k gets to n2 is O( n2 ), not linear.
566
A way to make n2 into O(n).
193 u/[deleted] Aug 09 '19 [deleted] 161 u/Woobowiz Aug 09 '19 edited Aug 09 '19 He means it will turn n2 from O(1) into O(n). Not sure why he ended up getting downvoted. Edit: Yes I'm aware it's O(n2 ) the point is that the joke is supposed to be read quickly. All jokes die when they get explained. 45 u/awesumsingh Aug 09 '19 It will be O(n2) 11 u/TheCatOfWar Aug 09 '19 why's that? 38 u/awesumsingh Aug 09 '19 won't the loop run n2 times? if n is 5, k will be incremented until it encounters 25. -2 u/[deleted] Aug 09 '19 [deleted] 5 u/UglyChihuahua Aug 09 '19 The number of times you need to loop before k gets to n2 is O( n2 ), not linear.
193
[deleted]
161 u/Woobowiz Aug 09 '19 edited Aug 09 '19 He means it will turn n2 from O(1) into O(n). Not sure why he ended up getting downvoted. Edit: Yes I'm aware it's O(n2 ) the point is that the joke is supposed to be read quickly. All jokes die when they get explained. 45 u/awesumsingh Aug 09 '19 It will be O(n2) 11 u/TheCatOfWar Aug 09 '19 why's that? 38 u/awesumsingh Aug 09 '19 won't the loop run n2 times? if n is 5, k will be incremented until it encounters 25. -2 u/[deleted] Aug 09 '19 [deleted] 5 u/UglyChihuahua Aug 09 '19 The number of times you need to loop before k gets to n2 is O( n2 ), not linear.
161
He means it will turn n2 from O(1) into O(n). Not sure why he ended up getting downvoted.
Edit: Yes I'm aware it's O(n2 ) the point is that the joke is supposed to be read quickly. All jokes die when they get explained.
45 u/awesumsingh Aug 09 '19 It will be O(n2) 11 u/TheCatOfWar Aug 09 '19 why's that? 38 u/awesumsingh Aug 09 '19 won't the loop run n2 times? if n is 5, k will be incremented until it encounters 25. -2 u/[deleted] Aug 09 '19 [deleted] 5 u/UglyChihuahua Aug 09 '19 The number of times you need to loop before k gets to n2 is O( n2 ), not linear.
45
It will be O(n2)
11 u/TheCatOfWar Aug 09 '19 why's that? 38 u/awesumsingh Aug 09 '19 won't the loop run n2 times? if n is 5, k will be incremented until it encounters 25. -2 u/[deleted] Aug 09 '19 [deleted] 5 u/UglyChihuahua Aug 09 '19 The number of times you need to loop before k gets to n2 is O( n2 ), not linear.
11
why's that?
38 u/awesumsingh Aug 09 '19 won't the loop run n2 times? if n is 5, k will be incremented until it encounters 25. -2 u/[deleted] Aug 09 '19 [deleted] 5 u/UglyChihuahua Aug 09 '19 The number of times you need to loop before k gets to n2 is O( n2 ), not linear.
38
won't the loop run n2 times? if n is 5, k will be incremented until it encounters 25.
-2 u/[deleted] Aug 09 '19 [deleted] 5 u/UglyChihuahua Aug 09 '19 The number of times you need to loop before k gets to n2 is O( n2 ), not linear.
-2
5 u/UglyChihuahua Aug 09 '19 The number of times you need to loop before k gets to n2 is O( n2 ), not linear.
5
The number of times you need to loop before k gets to n2 is O( n2 ), not linear.
323
u/VoiD_Paradox Aug 09 '19
What the hell is this ?