Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
TheLoneWolfling
on May 28, 2015
|
parent
|
context
|
favorite
| on:
PathFinding.js
Whoops, make that an O(log n) check, technically speaking, as the index of which CC a cell belongs to may take O(log n) space worst-case.
Though you can treat it as effectively O(1) time and O(n) space.
Consider applying for YC's Winter 2026 batch! Applications are open till Nov 10
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
Though you can treat it as effectively O(1) time and O(n) space.