25 docs tagged with "Algorithm"

Python

Basic principles of the BFS algorithm and its implementation using Python

Write a function to find the first non-repeating character in an array of strings using a hash table.

How to reverse a string using stacks

The basic principles of the DFS algorithm and how to implement it using Python

Concepts and characteristics of Dynamic Programming and Divide and Conquer

Write a function to calculate the maximum profit from a single transaction

Fundamental principles of greedy algorithms and their implementation in Python

Understand the basic principles of dynamic programming and how to efficiently solve problems with \(O(n)\) complexity

Python code example for Fibonacci sequence and time complexity analysis

How to implement merge sort in code and the time complexity of the sorting algorithm

Basic Principles of Quick Sort and its Time Complexity

Principles and time complexity of binary search

Concepts and Time Complexity of Bubble Sort

Principles of insertion sort and its time complexity

The principles and time complexity of selection sort

Greedy algorithms are methods for finding an optimal solution by making the best choice at each step.

Binary search is an efficient method for finding a specific value in a sorted array by repeatedly dividing the search interval in half.

BFS is an algorithm that explores nodes level by level from a starting node in a graph or tree.

Bubble sort is a simple yet intuitive algorithm for sorting an array by comparing and swapping adjacent elements.

DFS is an algorithm for traversing or searching tree or graph data structures, starting at the root node and exploring as far along each branch as possible.

Insertion sort sorts an array by progressively inserting each element into its appropriate position.

Merge Sort is a method that efficiently sorts an array using the divide and conquer algorithm.

Quick Sort is a fast sorting algorithm that uses a pivot to partition and sort an array.

Selection Sort is a simple and easy-to-understand sorting method that arranges elements by repeatedly finding the minimum value for each position in the array.