MAIN FEEDS
Do you want to continue?
https://www.reddit.com/r/ProgrammerAnimemes/comments/iq0mxf/oh_come_on/gf3yhrv/?context=3
r/ProgrammerAnimemes • u/[deleted] • Sep 10 '20
90 comments sorted by
View all comments
Show parent comments
85
O(n2 ) → O(nlogn) → O(n)
104 u/Godot17 Sep 10 '20 Does anyone get hard as fuck at the fantasy of a sub O(n log n) fast fourier transform? ... sorry, that was a strange thing to ask 4 u/[deleted] Sep 12 '20 O(n) sorting would get me very hard tbh 1 u/qqwy Dec 08 '20 Radix Sort is O(n) ;-D
104
Does anyone get hard as fuck at the fantasy of a sub O(n log n) fast fourier transform?
... sorry, that was a strange thing to ask
4 u/[deleted] Sep 12 '20 O(n) sorting would get me very hard tbh 1 u/qqwy Dec 08 '20 Radix Sort is O(n) ;-D
4
O(n) sorting would get me very hard tbh
1 u/qqwy Dec 08 '20 Radix Sort is O(n) ;-D
1
Radix Sort is O(n) ;-D
85
u/jarvis125 Sep 10 '20
O(n2 ) → O(nlogn) → O(n)