Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
jtsiskin
on Feb 22, 2021
|
parent
|
context
|
favorite
| on:
Go is not an easy language
Binary search won’t be any faster (in big O) because it’s backed by an array: you’ll still need to copy every element after the removed one from slot n to n-1.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: