I recently finished watching a tremendous free distributed systems course. The lecturer is a famous Dr. Martin Kleppmann who wrote a well-known book with the red wild boar cover 😄 This course includes 8 lectures split into 23 videos: 1. Introduction 2. Models of distributed systems 3. Time, clocks, and ordering
Algorithm complexity Definition The growth rate big O T(x)=O(g(x)) The growth rate of f(x) is asymptotically less than or equal to (<=) the growth rate of g(x) little o T(x)=o(g(x)) The growth rate of f(x) is asymptotically less than (<) the
Hi! As I mentioned earlier, I decided to recall some fundamental knowledge. In this article, I'd like to share with you the difference between sorting algorithms. I know, that it can be very simple, but how many times do you think about it? We all use it very often (for
It’s always interesting to learn something new, especially if it’s fundamental knowledge. Recently I have found a very interesting course about algorithms. Lectures are meaningful and practical. I recommend them to everyone who wants to understand basic algorithms. All algorithms are implemented in Java, but I decided to