Technically, the naïve implementation is perfectly fine for C/C++, so long as si... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

nknight on Jan 31, 2012 | parent | context | favorite | on: Nearly all binary search and merge sort implementa...

Technically, the naïve implementation is perfectly fine for C/C++, so long as size_t is at least 268 bits long on your platform. :)

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact