Let's state the obvious first, Bubble Sort is the easiest among sorting algorithms to be implemented. It has O(1) space complexity as it only require one (temporary) additional variable for swapping. The best case time complexity is O(n) when the list is already sorted. The problem with Bubble Sort is its worst time complexity. O(n^2)... Continue Reading →

"In their most basic sense, linked list and blockchain are very similar. A node (or block in case of the latter) contains the address (or hash) of the next node." Image source: me + MS Paint My first encounter with linked list was in the 2nd semester of my undergrad study. Since we only use... Continue Reading →