CS - Roadmap.sh(71)
-
3.4. Cache - 3.4.2 LFU Cache
CS - 3. Common Algorithms - 3.4. Cache - 3.4.2 LFU Cache 💡LFU Cache is a data structure that stores key-value pairs. It has a fixed size and when it is full, it removes the least frequently used key-value pair. It is a variation of the LRU Cache and is used in many applications such as caching web pages, caching database queries, and caching images. LFU 캐시는 키-값 쌍을 저장하는 데이터 구조입니다. 크기가 고정되어 있으며, 크..
2024.01.26 -
3.4. Cache - 3.4.1 LRU Cache
CS - 3. Common Algorithms - 3.4. Cache - 3.4.1 LRU Cache 3.4. Cache 💡Cache algorithms are used to manage the cache memory of a computer. Cache memory is a small amount of memory that is used to store data that is frequently accessed. This allows the computer to access the data faster than if it had to go to the main memory. Cache algorithms are used to determine which data should be stored in th..
2024.01.25 -
3.3. Search - 3.3.2 Linear Search
CS - 3. Common Algorithms - 3.3. Search - 3.3.1 Linear Search 💡 Linear search is a very simple algorithm that is used to search for a value in an array. It sequentially checks each element of the array until a match is found or until all the elements have been searched. 선형 검색은 배열에서 값을 검색하는 데 사용되는 매우 간단한 알고리즘입니다. 일치하는 항목이 발견되거나 모든 요소가 검색될 때까지 배열의 각 요소를 순차적으로 확인합니다. 선형 탐색(Linear Search)은 가장 기본적인 탐..
2024.01.24 -
3.3. Search - 3.3.1 Binary Search
CS - 3. Common Algorithms - 3.3. Search - 3.3.1 Binary Search Search Algorithms 💡 Search algorithms are used to find a specific item in a collection of items. For example, if you have a list of names and you want to find a specific name, you can use a search algorithm to find that name. 검색 알고리즘은 항목 모음에서 특정 항목을 찾는 데 사용됩니다. 예를 들어, 이름 목록이 있는데 특정 이름을 찾으려는 경우 검색 알고리즘을 사용하여 해당 이름을 찾을 수 있습니다. Binary Se..
2024.01.23 -
3.2. Recursion - 3.2.2 Non-Tail Recursion
CS - 3. Common Algorithms - 3.2. Recursion - 3.2.2 Non-Tail Recursion 💡Tail recursion is when a function can directly return the result of a recursive call - there are no outstanding operations, and there is no need for the call stack frame to be preserved. So it can be translated to a “goto with arguments”, and the stack usage will be constant. In “non-tail recursion”, there are outstanding ope..
2024.01.22 -
3.2. Recursion - 3.2.1 Tail Recursion
CS - 3. Common Algorithms - 3.2. Recursion - 3.2.1. Tail Recursion 3.2 Recursion 💡 Recursion is a method of solving problems where the solution depends on solutions to smaller instances of the same problem. A recursive algorithm must have a base case. A recursive algorithm calls itself, recursively. 재귀는 동일한 문제의 작은 인스턴스에 대한 해결책에 따라 해결책이 달라지는 문제를 해결하는 방법입니다. 재귀 알고리즘에는 기본 사례가 있어야 합니다. 재귀 알고리즘은 스스로를..
2024.01.21