Notes
-
Non-Comparison-Based Sorting Algorithms - DSA #7
How can Non-Comparison-Based Sorting Algorithms, such as Counting Sort and Radix Sort, so performant with just linear time complexity?
-
Advanced Sorting Algorithms - DSA #6
Efficient Sorting Algorithms such as Heap Sort, Quick Sort, and Merge Sort, why are they faster than elementary ones?
-
Basic Sorting Algorithms - DSA #5
In this note, I'll take a look at the idea of Elementary Sorting Algorithms along with evaluating each algorithm’s complexity.
-
Searching Algorithms - DSA #4
In this note, I'll discuss the concepts of Linear Search, Binary Search, and Interpolation Search, as well as taking a look at the detail performance analysis of each algorithm.
-
DeepSeek R1 - Paper Simplified #1
My take on explaining the ‘DeepSeek R1’ research paper, focusing on key concepts such as Chain of Thought reasoning, Reinforcement Learning, and Model Distillation.
-
Basic Machine Learning Algorithms (Part 1) - AI4B #5
In this note, we’ll be deep-diving into four machine learning algorithms: K-Nearest Neighbors, K-Means Clustering, Linear Regression, and Support Vector Machine!
-
Introduction to Machine Learning - AI4B #4
In this note, I'll discuss the concepts of Machine Learning, discover strategies in designing and evaluating machine learning systems, and provide insights on data preprocessing.
-
Algorithm Analysis - DSA #2
This is a note of Algorithm Analysis, where I delve into the methods for measuring an algorithm’s efficiency.
-
AI Programming Libraries - AI4B #1
In this note, I'll discuss some popular AI programming libraries, such as NumPy, Pandas, Matplotlib, and Seaborn.
-
Introduction to Data Structures and Algorithms - DSA #1
This is a note on the introduction to Data Structures and Algorithms, in which I explore some of the key concepts around the topic.