Skip to content

hoklavat/beginner-algorithms

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

78 Commits
HEADERS
HEADERS
 
 
MORE
MORE
 
 
OLD
OLD
 
 
01-Recursion(HeadTail).cpp
01-Recursion(HeadTail).cpp
 
 
02-Recursion(Sum).cpp
02-Recursion(Sum).cpp
 
 
03-Recursion(Factorial).cpp
03-Recursion(Factorial).cpp
 
 
04-Recursion(Fibonacci).cpp
04-Recursion(Fibonacci).cpp
 
 
05-Recursion(BinarySearch).cpp
05-Recursion(BinarySearch).cpp
 
 
06-Recursion(HanoiTowers).cpp
06-Recursion(HanoiTowers).cpp
 
 
07-Backtracking(NQueens).cpp
07-Backtracking(NQueens).cpp
 
 
08-Backtracking(GraphColoring).cpp
08-Backtracking(GraphColoring).cpp
 
 
09-Backtracking(KnightsTour).cpp
09-Backtracking(KnightsTour).cpp
 
 
10-DynamicProgramming(Fibonacci).cpp
10-DynamicProgramming(Fibonacci).cpp
 
 
11-DynamicProgramming(Knapsack).cpp
11-DynamicProgramming(Knapsack).cpp
 
 
12-Sorting(BubbleSort).cpp
12-Sorting(BubbleSort).cpp
 
 
13-Sorting(SelectionSort).cpp
13-Sorting(SelectionSort).cpp
 
 
14-Sorting(InsertionSort).cpp
14-Sorting(InsertionSort).cpp
 
 
15-Sorting(BucketSort).cpp
15-Sorting(BucketSort).cpp
 
 
16-Sorting(MergeSort).cpp
16-Sorting(MergeSort).cpp
 
 
17-Sorting(QuickSort).cpp
17-Sorting(QuickSort).cpp
 
 
18-Sorting(HeapSort).cpp
18-Sorting(HeapSort).cpp
 
 
19-Sorting(CountingSort).cpp
19-Sorting(CountingSort).cpp
 
 
20-Sorting(RadixSort).cpp
20-Sorting(RadixSort).cpp
 
 
21-Sorting(ShellSort).cpp
21-Sorting(ShellSort).cpp
 
 
22-DataStructures(SingleDimensionArray).cpp
22-DataStructures(SingleDimensionArray).cpp
 
 
23-DataStructures(TwoDimensionArray).cpp
23-DataStructures(TwoDimensionArray).cpp
 
 
24-DataStructures(SingleNode).cpp
24-DataStructures(SingleNode).cpp
 
 
25-DataStructures(SingleLinkedList).cpp
25-DataStructures(SingleLinkedList).cpp
 
 
26-DataStructures(DoubleNode).cpp
26-DataStructures(DoubleNode).cpp
 
 
27-DataStructures(DoubleLinkedList).cpp
27-DataStructures(DoubleLinkedList).cpp
 
 
28-DataStructures(SingleCircularLinkedList).cpp
28-DataStructures(SingleCircularLinkedList).cpp
 
 
29-DataStructures(DoubleCircularLinkedList).cpp
29-DataStructures(DoubleCircularLinkedList).cpp
 
 
30-DataStructures(Stack).cpp
30-DataStructures(Stack).cpp
 
 
31-DataStructures(Queue).cpp
31-DataStructures(Queue).cpp
 
 
32-DataStructures(BinaryTree).cpp
32-DataStructures(BinaryTree).cpp
 
 
33-DataStructures(BinaryHeap).cpp
33-DataStructures(BinaryHeap).cpp
 
 
34-DataStructures(Hash).cpp
34-DataStructures(Hash).cpp
 
 
35-DataStructures(Graph).cpp
35-DataStructures(Graph).cpp
 
 
36-DataStructures(PriorityQueue).cpp
36-DataStructures(PriorityQueue).cpp
 
 
37-DataStructures(AVLTree).cpp
37-DataStructures(AVLTree).cpp
 
 
38-DataStructures(Trie).cpp
38-DataStructures(Trie).cpp
 
 
39-Graph(TopologicalSort).cpp
39-Graph(TopologicalSort).cpp
 
 
40-Graph(Dijkstra).cpp
40-Graph(Dijkstra).cpp
 
 
41-Graph(BellmanFord).cpp
41-Graph(BellmanFord).cpp
 
 
42-Graph(FloydWarshall).cpp
42-Graph(FloydWarshall).cpp
 
 
43-Graph(UnionFind).cpp
43-Graph(UnionFind).cpp
 
 
44-Graph(Kruskal).cpp
44-Graph(Kruskal).cpp
 
 
45-Graph(Prim).cpp
45-Graph(Prim).cpp
 
 
46-Greedy(ActivitySelection).cpp
46-Greedy(ActivitySelection).cpp
 
 
47-Greedy(CoinChange).cpp
47-Greedy(CoinChange).cpp
 
 
48-Greedy(FractionalKnapsack).cpp
48-Greedy(FractionalKnapsack).cpp
 
 
49-DivideConquer(Maximum).cpp
49-DivideConquer(Maximum).cpp
 
 
50-DivideConquer(NumberOfWays).cpp
50-DivideConquer(NumberOfWays).cpp
 
 
51-DivideConquer(HouseOfThief).cpp
51-DivideConquer(HouseOfThief).cpp
 
 
52-DivideConquer(StringConversion).cpp
52-DivideConquer(StringConversion).cpp
 
 
53-DivideConquer(ZeroOneKnapsack).cpp
53-DivideConquer(ZeroOneKnapsack).cpp
 
 
54-DivideConquer(LongestCommonSubsequence).cpp
54-DivideConquer(LongestCommonSubsequence).cpp
 
 
55-DivideConquer(LongestPalindromicSubsequence).cpp
55-DivideConquer(LongestPalindromicSubsequence).cpp
 
 
56-DivideConquer(LongestPalindromicSubstring).cpp
56-DivideConquer(LongestPalindromicSubstring).cpp
 
 
57-DivideConquer(MinimumCost).cpp
57-DivideConquer(MinimumCost).cpp
 
 
58-DivideConquer(NumberOfPaths).cpp
58-DivideConquer(NumberOfPaths).cpp
 
 
ALGORITHMS_LIST.xlsx
ALGORITHMS_LIST.xlsx
 
 
ALGORITHMS_REMINDER.txt
ALGORITHMS_REMINDER.txt
 
 
README.md
README.md
 
 

Repository files navigation

ALGORITHMS AND DATA STRUCTURES

[SOFTWARE]

  • COMPILER: MinGW GNU C++
  • IDE: CodeLite

[FUNDAMENTAL ALGORITHMS]

  • Recursion
    • Factorial
    • Fibonacci
    • Hanoi Towers
    • Binary Search
  • Back Tracking
    • N-Queens
    • Vertex Coloring
    • Knight's Tour
  • Dynamic Programming
    • Fibonacci
    • Knapsack
  • Sorting
    • Bubble Sort
    • Selection Sort
    • Insertion Sort
    • Bucket Sort
    • Merge Sort
    • Quick Sort
    • Heap Sort
    • Radix Sort
    • Counting Sort
    • Shell Sort
  • Graph Algorithms
    • Topological Sort
    • Dijkstra Shortest Path Algorithm
    • Bellman-Ford Algorithm
    • Floyd Warshalls Algorithm
    • Union Find
    • Kruksals Algorithm
    • Prims Algorithm
  • Greedy Algorithms
    • Activity Selection Problem
    • Coin Change Problem
    • Fractional Knapsack Problem
  • Divide&Conquer Algorithms
    • Maximum
    • Fibonacci
    • Number of Ways
    • House Thief Problem
    • String Conversion
    • Zero-One Knapsack
    • Longest Common Subsequence
    • Longest Palindromic Subsequence
    • Longest Palindromic Substring
    • Minimum Cost to Reach End
    • Number of Paths to Reach End

[INDEPENDENT DATA STRUCTURES]

  • Array
    • One Dimensional
    • Two Dimensional
  • Linked List
    • Single
    • Single Circular
    • Double
    • Double Circular

[DEPENDENT DATA STRUCTURES]

  • Stack
  • Queue
  • Tree
  • Heap
  • Hash
  • Graph
  • AVL Tree
  • Trie

[SOURCE CODES]

  • 01-Recursion(HeadTail)
  • 02-Recursion(Sum)
  • 03-Recursion(Factorial)
  • 04-Recursion(Fibonacci)
  • 05-Recursion(BinarySearch)
  • 06-Recursion(HanoiTowers)
  • 07-Backtracking(NQueens)
  • 08-Backtracking(GraphColoring)
  • 09-Backtracking(KnightsTour)
  • 10-DynamicProgramming(Fibonacci)
  • 11-DynamicProgramming(Knapsack)
  • 12-Sorting(BubbleSort)
  • 13-Sorting(SelectionSort)
  • 14-Sorting(InsertionSort)
  • 15-Sorting(BucketSort)
  • 16-Sorting(MergeSort)
  • 17-Sorting(QuickSort)
  • 18-Sorting(HeapSort)
  • 19-Sorting(CountingSort)
  • 20-Sorting(RadixSort)
  • 21-Sorting(ShellSort)
  • 22-DataStructures(SingleDimensionArray)
  • 23-DataStructures(TwoDimensionArray)
  • 24-DataStructures(SingleNode)
  • 25-DataStructures(SingleLinkedList)
  • 26-DataStructures(DoubleNode)
  • 27-DataStructures(DoubleLinkedList)
  • 28-DataStructures(SingleCircularLinkedList)
  • 29-DataStructures(DoubleCircularLinkedList)
  • 30-DataStructures(Stack)
  • 31-DataStructures(Queue)
  • 32-DataStructures(BinaryTree)
  • 33-DataStructures(BinaryHeap)
  • 34-DataStructures(Hash)
  • 35-DataStructures(Graph)
  • 36-DataStructures(PriorityQueue)
  • 37-DataStructures(AVLTree)
  • 38-DataStructures(Trie)
  • 39-Graph(TopologicalSort)
  • 40-Graph(Dijkstra)
  • 41-Graph(BellmanFord)
  • 42-Graph(FloydWarshall)
  • 43-Graph(UnionFind)
  • 44-Graph(Kruskal)
  • 45-Graph(Prim)
  • 46-Greedy(ActivitySelection)
  • 47-Greedy(CoinChange)
  • 48-Greedys(FractionalKnapsack)
  • 49-DivideConquer(Maximum)
  • 50-DivideConquer(NumberOfWays)
  • 51-DivideConquer(HouseOfThief)
  • 52-DivideConquer(StringConversion)
  • 53-DivideConquer(ZeroOneKnapsack)
  • 54-DivideConquer(LongestCommonSubsequence)
  • 55-DivideConquer(LongestPalindromicSubsequence)
  • 56-DivideConquer(LongestPalindromicSubstring)
  • 57-DivideConquer(MinimumCost)
  • 58-DivideConquer(NumberOfPaths)

[OTHER ALGORITHMS]

  • Backtracking(HamiltonianCycle)
  • Bit(NextPowerOfTwo)
  • Bit(OppositeSigns)
  • Bit(TurnOff)
  • BranchBound(01KnapsackProblem)
  • Connectivity(EulerianPath)
  • DivideConquer(ClosestPoints)
  • Dynamic(CountBinaryString)
  • Dynamic(Fibonacci)
  • Dynamic(LargestSubarraySum)
  • Dynamic(MinimumCost)
  • Dynamic(NondecreasingNumbers)
  • Dynamic(NumberOfWays)
  • Dynamic(OptimalBinarySearchTree)
  • Dynamic(SubsetSum)
  • Dynamic(UglyNumbers)
  • Graph(BreadthFirstTraversal)
  • Graph(DepthFirstTraversal)
  • Graph(FindSameContacts)
  • Greedy(HuffmanCoding)
  • Math(BisectionMethod)
  • Math(CatalanNumbers)
  • Math(ChordMethod)
  • Math(Power)
  • Math(Probability)
  • MaximumFlow(Ford-Fulkerson)
  • Search(ClosestSum)
  • Search(FindMinimumUnsorted)
  • Sort(QuickSortDLL)
  • Sort(QuickSortSLL)

About

algorithms for beginners in c++ language.

Topics

tutorial algorithms cpp examples data-structures beginner

Resources

Readme
Activity

Stars

1 star

Watchers

2 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages