C Algorithm – Infix to Postfix Conversion using Stack – Data Structure – Infix expression:The expression of the form a op b.
Algorithm
263 Articles
263
Branch And Bound (Traveling Salesman Problem) – Branch And Bound Given a set of cities and distance between every pair of cities, the problem.
Python Algorithm – Ford-Fulkerson Algorithm for Maximum Flow Problem – Given a graph which represents a flow network where every edge
Python Algorithm -Introduction to Stack – Data Structure -Stack is a linear data structure which follows a particular order in which the operations
C++ program How to turn off a particular bit in a number-Bit Algorithm-Given a number n and a value k, turn of the k’th bit in n.
C Programming – Ugly Numbers – Dynamic Programming Ugly numbers are numbers whose only prime factors are 2, 3 or 5. Every step we choose the smallest one
C++ Programming – Ugly Numbers – Dynamic Programming Ugly numbers are numbers whose only prime factors are 2, 3 or 5. Every step we choose the smallest one
Java Programming – Ugly Numbers – Dynamic Programming Ugly numbers are numbers whose only prime factors are 2, 3 or 5. Here we use similar merge
Python Programming – Ugly Numbers – Dynamic Programming Ugly numbers are numbers whose only prime factors are 2, 3 or 5.
Shortest Path Some interesting shortest path questions The shortest path may change. The reason is, there may be different number of edges