AlgorithmImplementations Save
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-jacobis-gauss-seidal-bisection-false-position-newton-raphson-fixed-point-secant-cigarette-smokers-genetic-huffman-a-a*-star-binary-knuth-morris-pratt-kmp-quick-thread-priority-based-premitive-shortest-job-non-primitive-arithmetic-expression-data-structures-list-node-implementation-one-two-way-linked-stack-string-graph-numerical-methods-equation-solving-solve-process-problem-search-sort-prime-ugly-friend-perfect-fibonacci-factorial-factor-number)
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
Algorithm Implementations is licensed under MIT License.
Open Source Agenda Badge
