# Category: Algorithms

## Bubble Sort… – FcukTheCode

Parameter Description Stable Yes In place Yes Best case complexity O(n) Average case complexity O(n^2) Worst case complexity O(1) The BubbleSort compares each successive pair…

## Sorting – fcukthecode

Parameter Description Stability A sorting algorithm is stable if it preserves the relative order of equal elements after sorting. In place A sorting algorithm is…

## Huffman Coding : Change-making problem ..:- fcukthecode

Huffman Coding -: Greedy Algorithms π π πLink –> HUFFMAN CODING Given a money system, is it possible to give an amount of coins and…

## Huffman Coding – Activity Selection Problem

Huffman Coding -: Greedy Algorithms π π πLink –> HUFFMAN CODING The ProblemYou have a set of things to do (activities). Each activity has a…

## Huffman Coding -: Greedy Algorithms …FTC

Huffman Coding β Activity Selection Problemπ π Activity Selection Problem Huο¬man code is a particular type of optimal preο¬x code that is commonly used for…

## Detecting a cycle in a directed graph using Depth First Traversal …FTC

Graph Theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects.Introduction To Graph Theory β¦FTC π π π…

## Topological Sort in Graph …FTC

Graph Theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects.Introduction To Graph Theory β¦FTC π π π…

## Storing Graphs (Adjacency List) …fcukthecode

Graph Theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects.Introduction To Graph Theory β¦FTC π π π…

## Introduction To Graph Theory …FTC

Graph Theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects. Did you know, almost all the problems…

## Adjacency Matrix (Storing Graphs) …-fcukthecode

Graph Theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects.Introduction To Graph Theory β¦FTC π π π…

## Dijkstra’s Shortest Path Algorithm …fcukthecode

Before proceeding, it is recommended to have a brief idea about Adjacency Matrix and BFS. Breadth-first-search (BFS) is an algorithm for traversing or searching tree…

## Breadth-First Search …-fcukthecode

Finding the Shortest Path from Source to other Nodes Breadth-first-search (BFS) is an algorithm for traversing or searching tree or graph data structures. It starts…

## Algorithm Complexity Big O Notation (With Examples) …FcukTheCode

For Big-Theta Notations and Big-Omega Notations, On another page π πAlgorithm Complexity(Big-Theta, Big-Omega, Big-O Notations)Β  π π π π DefinitionThe Big-O notation is at its…

## Algorithm Complexity(Big-Theta, Big-Omega, Big-O Notations) …Fcukthecode

For Big O Notation, On Another Page π π Big O Notation (With Examples) π Unlike Big-O notation, which represents only upper bound of the…