Algorithms you should know as developer π
π§΅
π§΅
1οΈβ£ Sorting π₯
Sorting Algorithms, Arrange the items of a list on order
β‘οΈ Bubble Sort
β‘οΈ Merge Sort
β‘οΈ Quick Sort
β‘οΈ Heap Sort
Sorting Algorithms, Arrange the items of a list on order
β‘οΈ Bubble Sort
β‘οΈ Merge Sort
β‘οΈ Quick Sort
β‘οΈ Heap Sort
2οΈβ£ Search π§
Find a element in a data set.
β‘οΈ Binary Search
β‘οΈ Breath First Search
Find a element in a data set.
β‘οΈ Binary Search
β‘οΈ Breath First Search
3οΈβ£ Dynamic Programming π
Method for solving complex problem by breaking down into simpler subproblems
Method for solving complex problem by breaking down into simpler subproblems
4οΈβ£ Hashing #οΈβ£
It is a mathematical algorithm that maps data of arbitrary size to a hash of a fixed size.
It is a mathematical algorithm that maps data of arbitrary size to a hash of a fixed size.
5οΈβ£ Divide and Conquer β
A divide-and-conquer algorithm recursively breaks down a problem into two or more sub-problems of the same or related type, until these become simple enough to be solved directly.
A divide-and-conquer algorithm recursively breaks down a problem into two or more sub-problems of the same or related type, until these become simple enough to be solved directly.
6οΈβ£ Recursion algorithm π
Recursion is a method of solving a problem where the solution depends on solutions to smaller instances of the same problem
Recursion is a method of solving a problem where the solution depends on solutions to smaller instances of the same problem
Thanks for reading this thread β€οΈ
If you found useful, please retweet the first one βΊοΈ
If you found useful, please retweet the first one βΊοΈ
Loading suggestions...