Skip to content

abramovd/Cormen-Algorithms-in-Cpp

Repository files navigation

C++ implementation of the well-known algorithms

Based on the Introduction to algorithms, 3rd Edition: Cormen, Leiserson, Rivest and Stein.

List of currently implemented algorithms:

  • Sorting and Order Statistics
    • MaxSubArray
    • InsertionSort
    • MergeSort
    • HeapSort
    • MaxPriorQueue
    • QuickSort
    • CountingSort
    • RadixSort
    • BucketSort
    • RandomizedSelect
  • Data Structures
    • Stack based on Array
    • Stack based on Linked List
    • Queue based on Array
    • Queue based on Linked List
    • Hash Table - Collision Resolution
    • Hash Table - Open Addressing
    • Binary Search Tree

How to run

In order to run these algorithms you need to clone this to you hard drive and then run it with GCC 4.2 or further. For example, in order to run QuickSort.cpp on Mac or Linux you should do the following:

git clone https://github.com/abramovd/Cormen-Algorithms-in-Cpp.git
g++ -o a.out QuickSort.cpp
./a.out

Author

Dmitry Abramov ©

About

No description, website, or topics provided.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages