Hacker Newsnew | past | comments | ask | show | jobs | submit | Sianko's commentslogin

Another "fancy" obsidian, with providing "cool" themes by quite a lot of bucks... I do not see even the syncing method here.


I think the value of a repeated number can be found much easier: ``` long sum = 0; for (int i = 0; i < n; i++) { if(i < n - 1) { sum -= i; } sum += array[i]; }

printf("Element %d\r\n", sum); ```


This doesn't work if more than one value repeats itself.


So there are many different flavors of crc32. Usually you can always change the initialization value. This algorithm is only one use case.

Check this table out https://www.crccalc.com/?crc=123456789&method=&datatype=0&ou...


I would really appreciate someone documenting exactly which variant of CRC32 is being used here.



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

Search: