I’ve mentioned this before, but I’m gonna explain it in more detail. What is dynamic programming? An algorithmic paradigm that 1️⃣ solves a given complex problem by breaking it into subproblems...
[Data Sturcture] Quick sort
What is quick sort? Make a pivot which means middle index to divide array. It is based on divide and conquer algorithm Implementation ⭐️ The point quickSort() : main sort() partitio...
[Data Sturcture] sort methods
📌 What is ###.sort()? sort the datas of array or list ascending order or descending order 📌 Sort array Arrays.sort() The primitive way to sort array It will increase time complexity on ...
[Algorithm] Fibonacci numbers1
What is fibonacci numbers? 1️⃣ The first two numbers in the Fibonacci sequence are 0 and 1, and each subsequent number is the sum of the previous two. 2️⃣ Enumeration of the Fibonacci numbers ca...
[Algorithm] Caterpillar method 3
See previous post Tasks 4. MinAbsSumOfTwo in codility (Lesson 15) : Find the minimal absolute value of a sum of two elements. My first answer It occurred timeout error… Time complexity: O(N ...