# 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…Read More »Bubble Sort… – FcukTheCode

## 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…Read More »Sorting – fcukthecode

## 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…Read More »Huffman Coding -: Greedy Algorithms …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 👈 👈 😉…Read More »Topological Sort in Graph …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 👈 👈 😉…Read More »Storing Graphs (Adjacency List) …fcukthecode

## 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…Read More »Introduction To Graph Theory …FTC

## 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 👈 👈 😉…Read More »Adjacency Matrix (Storing Graphs) …-fcukthecode