There is a whole bunch of interesting and efficient (both in practice and in theory) searching and sorting algorithms that rely on bitwise operations. Only a few weeks ago, I wrote a short text about ints and bitwise operations:
https://github.com/yourbasic/int It covers radix sorting, integer sorting in O(n log log n) time, Bloom filters, bit sets and few other things. On Sunday, July 23, 2017 at 5:36:14 AM UTC+2, Alexey Dvoretskiy wrote: > > Hello golang-nuts. > > I'm new to Go language and have no solid experience with C/C++. > I was a database programmer with some Python and I was able to get around > without bitwise operators easily. > Of course, I ran into tons of issues with performance, deployment and > other stuff. That is why I switched to Go. > > The question is what are practical applications of bitwise operations in > Go and when I should use/learn them? > > Thanks > Alex > -- You received this message because you are subscribed to the Google Groups "golang-nuts" group. To unsubscribe from this group and stop receiving emails from it, send an email to golang-nuts+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/d/optout.
