I’m from Hue, Vietnam, and I’m currently a freshman at University of Science, VNUHCM.
I’m super excited to share my experiences and insights here through the notes I’ve written. I’ll keep them simple and easy to understand so that everyone can follow along, and they’ll also be a great way for me to look back on what I’ve learned. Hope you find them useful!
If you've got something to share, just shoot me an email at hnimnot@icloud.com!
How can Non-Comparison-Based Sorting Algorithms, such as Counting Sort and Radix Sort, so performant with just linear time complexity?
Efficient Sorting Algorithms such as Heap Sort, Quick Sort, and Merge Sort, why are they faster than elementary ones?
In this note, I'll take a look at the idea of Elementary Sorting Algorithms along with evaluating each algorithm’s complexity.
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.
My take on explaining the ‘DeepSeek R1’ research paper, focusing on key concepts such as Chain of Thought reasoning, Reinforcement Learning, and Model Distillation.
