**"C/C++ Programming"**

It is string searching algorithm in which basically two strings given -a text and a pattern, and it determine whether the pattern appears in the text. Knuth, Morris and Pratt (KMP) discovered this algorithm by close analysis of the naive algorithm and then proposed a linear time algorithm for the string matching problem. This algorithm […]

The basic structure of Dijkstra’s algorithm is to maintain an estimate of the shortest path from the source vertex to each vertex in the graph. Call this estimate d[v]. It is a solution to the single-source shortest path problem in graph theory. This algorithm can be used for directed and indirected graphs. All edges must […]

Boyer-Moore is an algorithm that improves the performance of pattern searching into a text by considering some observations. As in the naïve searching algorithm, the Boyer-Moore algorithm successively aligns pattern P with string T and then checks whether P matches the opposing characters of T. Further, after […]

This is a guess my number game code using C++. You can play this game systematically to guess the number within 7 or less questions. However, this game doesn’t stop until you successfully guessed the number stored by this program. In this game the computer chooses a random number between 1 and 100, and the […]

This is a currency converter program that converts amounts of different currencies entered into different currencies. It converts following currencies in between: Euro, British pound, Pakistani rupee, Canadian dollars, Australian dollars, and US dollars. This program can easily extended to include further currencies. You need to add two blocks of switch cases for new currency, […]

In mathematics, the Greatest Common Divisor (GCD), also referred to as sometimes Greatest Common Factor (GCF), Highest Common Factor (HCF), Greatest Common Measure (GCM), Highest Common Divisor (HCD) of two or more integers, when at least one of them is not zero, is the largest positive integer that divides the numbers without a remainder. This program will find Greatest Common Divisor (GCD) using C++. […]

Fibonacci series is an integer in the infinite sequence 1, 1, 2, 3, 5, 8, 13, … of which the first two terms are 1 and 1 and each succeeding term is the sum of the two immediately preceding. By definition, the first two numbers in the Fibonacci sequence are 1 and 1, or 0 […]

Hi everyone! This is a very useful program that tells your western zodiac and chinese zodiac signs. This program also tells you the year you born if you enter your current age. I found this program from the stackexchange. I thought it might be helpful for some of our visitors who want to develop […]

A Priority Queue is a data structure that is useful in problems where you need to rapidly find and remove the largest element from a collection of values. An everyday example of a priority queue is the to do list of tasks waiting to be performed.

A more computer-related example of a […]

All-pairs Shortest Path (APSP) algorithm finds the shortest path between any two nodes in a graph. It can be used to find the shortest path between two cities and other similar problems. There are many algorithms falling this APSP category. The one that we are discussing is the Floyd Warshall algorithm. The Floyd Warshall algorithm […]

### Popular Posts (last 30 days)

- Attendance Management Sys… 1305 view(s)
- Applications of Stack in … 1031 view(s)
- Circular Linked Lists 915 view(s)
- Implementing Stack Data S… 675 view(s)
- Graph Implementation in C… 624 view(s)
- Simple Currency Converter… 535 view(s)
- Recursive Factorial funct… 338 view(s)
- Finding Minimum, Maximum … 324 view(s)
- GRASP Design Patterns 320 view(s)
- Boyer-Moore String Search… 243 view(s)

### Related Links

### Tags

Android C-Sharp C/C++ language Classes Data structures Design Pattern Eclipse Game Development Graphics Design Books HTML iPhone JAVA JAVA GUI MIPS Assembly Mobile Programming Books Object Oriented PDF PHP Programming Programming Books Programming Languages Books Python RaphaelJS REST Source Code Threads Tutorial Web Development Books