https://github.com/sahilsahil934/algorithms

This repo contains all existing types of Algorithms implemented in C++
https://github.com/sahilsahil934/algorithms

Last synced: 2 months ago
JSON representation

This repo contains all existing types of Algorithms implemented in C++

• Host: GitHub
• URL: https://github.com/sahilsahil934/algorithms
• Owner: sahilsahil934
• License: mit
• Created: 2018-12-11T21:34:49.000Z (about 6 years ago)
• Default Branch: master
• Last Pushed: 2018-12-05T15:37:21.000Z (about 6 years ago)
• Last Synced: 2024-08-16T19:34:33.394Z (5 months ago)
• Language: C++
• Homepage: https://github.com/Bhupesh-V/Algorithms
• Size: 50.8 KB
• Stars: 0
• Watchers: 1
• Forks: 6
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • Contributing: CONTRIBUTING.md
  • License: LICENSE

Awesome Lists containing this project

README

        

Algorithms


This repo contains all existing types of Algorithms implemented in C++ 

![Algorithms](https://img.shields.io/badge/33%25-Algorithms-blue.svg)

![commit status](https://img.shields.io/badge/commit%20status-master-orange.svg)

[![Build Status](https://travis-ci.org/Bhupesh-V/Algorithms.svg?branch=master)](https://travis-ci.org/Bhupesh-V/Algorithms)

![Language](https://img.shields.io/badge/Language-C++-green.svg)

[![CodeFactor](https://www.codefactor.io/repository/github/bhupesh-v/algorithms/badge)](https://www.codefactor.io/repository/github/bhupesh-v/algorithms)

## 1. Searching

  

    Searching Technique

    Complexity(Worst Case) 

    Link

    Any Other Resource

  

  

    Linear

    O(n) 

    Linear Search

    

  

  

    Binary

    O(log n) 

    Binary Search

    

  

  

    Ternary

    O(log n) 

    Ternary Search

    

  

  

    Interpolation

    O(log log n) 

    Interpolation Search

    Derivation of Formula

  

  

    Jump

    O(n ½) 

    Jump Search

    

  

## 2. Sorting 

  

    Sorting Technique

    Complexity(Worst Case) 

    Link

    Method

    Stable

    Class

  

  

    Selection

    O(n^2) 

    Selection Sort

    Selection

    No

    Comparison Sort

  

  

    Insertion

    O(n^2) 

    Insertion Sort

    Insertion

    Yes

    Comparison Sort

  

  

    Counting

    O(n + k) 

    Counting Sort

    -

    Yes

    Non-Comparison Sort

  

  

    Quick

    O(n log n) 

    Quick Sort

    Partitioning

    No

    Comparison Sort

  

  

    Bubble

    O(n^2) 

    Bubble Sort

    Exchanging

    Yes

    Comparison

  

  

    Merge Sort

    O(n log n) 

    Merge Sort

    Merging

    Yes

    -

  

## 3. Pattern Matching

  

    Technique

    Complexity(Worst Case) 

    Link

  

  

    Knuth-Morris-Pratt

    O(n+m) 

    KMP

  

## 4. Dynamic Programming

  

    Technique

    Complexity(Worst Case) 

    Link

  

  

    Fibonacci

    O(n) 

    fibonacci

  

## 5. Divide & Conquer

  

    Technique

    Complexity(Worst Case) 

    Link

  

  

    Binary Search

    O(log n) 

    Binary Search

  

  

    Quick Sort

    O(n log n) 

    Quick Sort

  

  

    Merge Sort

    O(n log n) 

    Merge Sort

  

    

## License

[MIT License](https://github.com/Bhupesh-V/Algorithms/blob/master/LICENSE)

## Contribution

See [CONTRIBUTING](CONTRIBUTING.md) file for contributing.

--------------------------

> All the Algorithms have been complied using GCC 8.1.0 (MinGW) on a Winodws Machine & GCC 8.2.0 on Ubuntu (Mate) Machine.