Self-sorting lists can be very handy. For instance, we could easily implement a priority queue by utilizing a sorted list, and that’s something we’re going to do, simply using the comparison method on competing priorities. Self-sorting arrays make putting everything in order in a messaging queue fairly simple.
As you can see binary arithmetic calculations are easy-peesy. I mean you only have to digits to worry about: 1 and 0. I remember learning my multiplication tables and 7 was the hardest for me to remember. I was never good at 7 until I was an adult. But, as a kid, I thought I had to know it all now… I couldn’t imagine myself as an adult.
The four most popular methods for encoding (representing) negative binary numbers are known as “sign and magnitude”, “ones’ complement”, “two’s complement”, and “Excess-K”. There are alternative methods as well that aren’t as popular such as negative binary where the number base itself is actually negative (being negative 2).
That’s all there is to hexadecimal and octal. As you can see, hopefully, it’s not too complicated and is quite a bit like binary. Hexadecimal and octal were introduced to me when I was editing data files in a text editor that displayed the hexadecimal values of each byte as well. It was a pretty useful program.