summary
0
·
0
·
Optimise Adjacency Matrix Using Bitwise Operations in Tideman Algorithm
·2555 words·12 mins
tideman
graph theory
bitwise operation
adjacency list
adjacency matrix
C
summary
The adjacency matrix is a square matrix used to represent a finite graph in graph theory. However, it can be space-consuming for sparse graphs. This article incorporates bitwise operations into the application of the adjacency matrix in the Tideman voting algorithm and achieves O(n) and Ω(1) for finding the winners.
Common Git Jargon and Commands
·2525 words·12 mins
git
summary
When I asked Juju “What are your favourite parts of programming?” Git was one of the answers I received. It is so powerful yet concise that it leads me to write this blog.
A Brief Summary of Machine Learning
·2748 words·13 mins
machine learning
artificial intelligence
summary
We are now in a rapidly evolving world filled with thrilling challenges and boundless opportunities. Each of us has the potential to be an observer, participant, or even a catalyst in this dynamic process.