Category Archives: Algorithm

Difference between Flowchart and Algorithm

Welcome back readers, today I’ll be discussing the difference between flowchart and algorithm. But before getting started, I want to discuss a bit about both the topics. Flowchart A flowchart is a diagram which represents different steps that can help in solving a problem. It is a diagram which is made step by step using different… Read More »

Binary Search in C

Here you will get program for binary search in C. Binary search algorithm can be applied on a sorted array to search an element. Search begins with comparing middle element of array to target element. If both are equal then position of element is returned. If target element is less than middle element of array… Read More »

Vigenere Cipher in C and C++

In this tutorial you will learn about vigenere cipher in C and C++ for encryption and decryption. Vigenere Cipher is kind of polyalphabetic substitution method. It is used for encryption of alphabetic text. For encryption and decryption Vigenere Cipher Table is used in which alphabets from A to Z are written in 26 rows. Also… Read More »

Asymptotic Notations

Here you will learn about Asymptotic Analysis and Asymptotic Notations in detail. It is common that we write Algorithm before writing code to any problem. There may exist more than one solution for a particular problem. But we need the solution which is better in time and space complexities. To compare and analyse algorithms complexities… Read More »

Dining Philosophers Problem in C and C++

In this tutorial you will learn about Dining Philosophers Problem in C and C++ with program example. What is Dining Philosophers Problem? There are some Philosophers whose work is just thinking and eating. Let there are 5 (for example) philosophers. They sat at a round table for dinner. To complete dinner each must need two Forks (spoons).… Read More »

Bellman-Ford Algorithm in C and C++

Here you will learn about Bellman-Ford Algorithm in C and C++. Dijkstra and Bellman-Ford Algorithms used to find out single source shortest paths. i.e. there is a source node, from that node we have to find shortest distance to every other node. Dijkstra algorithm fails when graph has negative weight cycle. But Bellman-Ford Algorithm won’t fail… Read More »

Matrix Chain Multiplication in C and C++

Here you will learn about Matrix Chain Multiplication with example and also get a program that implements matrix chain multiplication in C and C++. Before going to main problem first remember some basis. We know that, to multiply two matrices it is condition that, number of columns in first matrix should be equal to number of… Read More »