Analysis Of Algorithm|| Why It Is Important?

What is the Algorithm? According to Wikipedia, “In mathematics and computer science, an algorithm is a finite sequence of well-defined, computer-implementable instructions, typically to solve a class of problems or to perform a computation”. We…

Recursion | The Art of Repetition

What is Recursion? The process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called as recursive function. Certain problems can be solved quite easily Using a…

Binary Search

Binary Search Binary Search is a searching algorithm for searching an element in a sorted list or array. This Algorithm is efficient than the Linear Search algorithm and performs the search operation in logarithmic time…

Linear Search in C/C++

Linear Search Linear Search in C/C++ means to sequentially traverse a given list or array and check if an element is present in the respective array or list. The idea is to start traversing the…

Array in C| All You Need To Know

Introduction To Array in C An array in c is a collection of items of the same data type stored at contiguous memory locations. This makes it easier to calculate the position of each element…

Dynamic Programming

Solving Dynamic Problem Easy Dynamic Programming (DP) is a technique that solves a few specific form of problems in Polynomial Time. Dynamic Programming solutions are quicker than the exponential brute method and can be effortlessly…