Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
bhrgunatha
on Jan 25, 2019
|
parent
|
context
|
favorite
| on:
Special Cases Are a Code Smell
The amortized cost of prepend (unshift in ruby) is O(1) (since Ruby 2). Of course that means at some point you'll get O(n) prepend.
[1]
https://stackoverflow.com/questions/8353026/what-is-the-run-...
userbinator
on Jan 25, 2019
[–]
Getting amortised O(1) prepend is interesting because it's just like append, except you "center" or "right-justify" (if you don't care about O(1) append) the array in the allocated space, and exponentially reallocate when full as with append.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
[1] https://stackoverflow.com/questions/8353026/what-is-the-run-...