LWLim Woojaeinjaylog.hashnode.dev·May 18 · 8 min read[CS fundamentals] Linked List Creation & Insertion explained in C. Introduction In this article, we will look at fundamentals of linked lists. Linked list is a really powerful data structure especially when you deal with insertion and deletion. Imagine an array with 00
LWLim Woojaeinjaylog.hashnode.dev·Mar 25 · 5 min read[CS Fundamentals] Pointers in CIntroduction In this article, I will be talking about pointers in C. Pointers might be a bit hard concept for beginners, but they are essential to understand what your programs are doing. Moreover, th00
LWLim Woojaeinjaylog.hashnode.dev·Jun 30, 2025 · 4 min read[SQL] Writing Efficient SQL QueriesThink of yourself building a program. It can be any types, such as website, app, etc. These applications may require database to show the data that the user requested. For example, you can think of a table that stores GPS-related data. The longitude ...00
LWLim Woojaeinjaylog.hashnode.dev·May 19, 2025 · 3 min read[CS Fundamentals] Binary SearchIdea Binary Search is a powerful algorithm to search for a certain value. If you were to find 3 in an array = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9], how are you going to come up with the index of 3? The first method that pops up in your head would be lookin...00
LWLim Woojaeinjaylog.hashnode.dev·May 12, 2025 · 4 min read[CS Fundamentals] Sorting AlgorithmsSelection Sort Selection sort is the simplest way to sort an array. Pretend that index 0 is the smallest, and we look at each element. We select the smallest element from other index and swap the two elements. array = [5, 7, 9, 0, 3, 1, 6, 2, 4, 8] ...00
