Greedy Algorithms

2025-06-19

Backtracking

BacktrackingBacktracking is a general algorithmic technique that considers searching every possible combination in order to solve a computational problem. It is often used for solving constraint satisfaction problems, such as puzzles, combinatorial problems, and optimization problems. PermutationsThe problem of generating all permutations of a given list of distinct integers can be solved using backtracking. The idea is to build the permutations incrementally and explore each possibility recu...

2025-06-18

Divide and Conquer Algorithm

Divide and Conquer AlgorithmHanota TowerThe Hanota Tower, also known as the Tower of Hanoi, is a mathematical puzzle that consists of three rods and a number of disks of different sizes. The objective is to move the entire stack of disks from one rod to another, following these rules: Only one disk can be moved at a time. Each move consists of taking the upper disk from one of the stacks and placing it on top of another stack or on an empty rod. No disk may be placed on top of a smaller disk...

2025-06-18

Dynamic Programming

Dynamic ProgrammingDynamic programming is a method for solving complex problems by breaking them down into simpler subproblems, storing the results of those subproblems to avoid redundant work. It is particularly useful for optimization problems where the solution can be expressed as a combination of solutions to subproblems. Fibonacci SequenceThe Fibonacci sequence is a series of numbers where each number is the sum of the two preceding ones, usually starting with 0 and 1. The nth Fibonacci ...

2025-06-18

Search

SearchSearch is a fundamental operation in computer science that involves finding a specific element or value within a data structure. There are various search algorithms, each with its own advantages and disadvantages depending on the context and the type of data structure being used. Some common search algorithms include: Linear Search: This algorithm checks each element in the data structure sequentially until it finds the target element or reaches the end of the structure. It has a time ...

2025-06-17

Sort

SortStable Sort: Stable sort is a sorting algorithm that preserves the relative order of equal elements in the sorted output.Local Sort: Local sort is a sorting algorithm that sorts elements in a small region of the list. Bubble SortBubble sort is a simple sorting algorithm that repeatedly steps through the list, compares adjacent elements and swaps them if they are in the wrong order. The pass through the list is repeated until the list is sorted. Stable Sort: YesLocal Sort: Yes 12Time compl...

Greedy Algorithms

Greedy Algorithms

Maximun Swap

Candy