Skip to content

Implementation of Elementary Algorithms (infix-prefix-postfix-evaluation-to-longest-common-increasing-sub-sequence-activity-selection-balance-kd-binary-heap-binomial-tree-breath-depth-first-search-max-flow-shortest-path-topological-sort-calculus-derivative-integration-forward-interpolation-simpson-rule-intersecting-area-non-linear-equation-jacob…

master
Go to file
Code

Files

Permalink
Failed to load latest commit information.
Type
Name
Latest commit message
Commit time
Dec 17, 2015
Dec 17, 2015
Dec 17, 2015
Dec 17, 2015
Dec 17, 2015
Jun 19, 2017

README.md

Algorithm Implementations

Implementation of Elementary Algorithms

The project contains algorithms that were implemented in my Data Structure & Algorithms course. Yes, I got marks for those. :P

Categorical List of Algorithms

AlgorithmImplementations
 ├─ arithmeticExpressions
 │ ├─ InfixEvaluation
 │ ├─ InfixToPostfix
 │ ├─ InfixToPrefix
 │ ├─ PostfixEvaluation
 │ └─ PrefixEvaluation
 ├─ dataStructures
 │ ├─ listImplementation
 │ │ ├─ implementationUsingNode
 │ │ │ ├─ OneWayLinkedList
 │ │ │ └─ TwoWayLinkedList
 │ │ ├─ OneWayLinkedList
 │ │ └─ TwoWayLinkedList
 │ ├─ stack
 │ │ ├─ StackImplementation
 │ │ └─ StackImplementation
 │ ├─ string
 │ │ ├─ String
 │ │ ├─ StringLongestCommonSubSecuence
 │ │ └─ StringLongestIncreasingSubSecuence
 │ └─ tree
 │   ├─ ActivitySelection
 │   ├─ BalanceTree
 │   ├─ KdTree
 │   ├─ BinaryHeap
 │   └─ BinomialTree
 ├─ graph
 │ ├─ BreathFirstSearch
 │ ├─ DepthFirstSearch
 │ ├─ MaxFlow
 │ ├─ ShortestPathAlgorithm
 │ └─ TopologicalSort
 ├─ numericalMethods
 │ ├─ calculus
 │ │ ├─ DerivetivesOnDifferentPoints
 │ │ ├─ IntegrationForwardInterpolation
 │ │ ├─ IntegrationSimpsonRule
 │ │ └─ IntersectingArea
 │ └─ equationSolving
 │   ├─ LinearEquationSolvingProcess
 │   │ ├─ JacobisMethod
 │   │ └─ GaussSeidalMethod
 │   └─ NonLinearEquationSolvingProcess
 │     ├─ BisectionMethod
 │     ├─ FalsePosition
 │     ├─ NewtonRaphson
 │     ├─ FixedPoint
 │     └─ Secant
 ├─ others
 │ ├─ cigaretteSmokersProblem
 │ ├─ geneticAlgorithm
 │ └─ huffmanAlgorithm (¿) (~)
 ├─ search
 │ ├─ AStarSearch
 │ ├─ BinarySearch
 │ └─ KnuthMorrisPrattAlgorithm
 ├─ sort
 │ └─ QuickSort
 ├─ thread
 │ ├─ priorityBased
 │ │ ├─ nonpreemptive
 │ │ └─ preemptive
 │ └─ shortestJob
 │   ├─ nonpreemptive
 │   └─ preemptive
 └─ playWithNumbers
   ├─ factorial
   │ ├─ BigFactorials
   │ ├─ DigitsOfFactorial
   │ └─ FactorsOfFactorial
   ├─ fibonaciiNumber
   │ ├─ FibonaciiNumber
   │ ├─ FibonaciiSerise
   │ └─ FibonaciiSum
   ├─ otherNumbers
   │ ├─ FriendNumbers
   │ └─ PerfectNumberHaunting
   ├─ pascalTriangle
   │ ├─ BetterPascalTriangle
   │ ├─ EasyPascalTriangle
   │ ├─ PascalTriangle
   │ ├─ Piramid
   │ └─ RealPascalTriangle
   ├─ primeNumber (Scrt Chmbr)
   │ ├─ AnotherWayOfPrimeNumberHaunting
   │ ├─ DefinitePrimeNumberHaunting
   │ ├─ Factors
   │ ├─ GreatPrimeNumberHaunting
   │ ├─ GreatestPrimeNumberHaunting
   │ ├─ PrimeNumber
   │ ├─ PrimeNumberHaunting
   │ └─ PrimeNumberHaunting
   └─ time
     ├─ AgeCalculator
     ├─ LeapYearCounter
     ├─ Stopwatch
     └─ TimeAfter

License

MIT License
Algorithm Implementations is licensed under MIT License.

About

Implementation of Elementary Algorithms (infix-prefix-postfix-evaluation-to-longest-common-increasing-sub-sequence-activity-selection-balance-kd-binary-heap-binomial-tree-breath-depth-first-search-max-flow-shortest-path-topological-sort-calculus-derivative-integration-forward-interpolation-simpson-rule-intersecting-area-non-linear-equation-jacob…

Topics

Resources

License

Releases

No releases published

Packages

No packages published
You can’t perform that action at this time.