Author: Riyaz Cobra

C Program to find an Element using Binary Search

Binary Search is one of the most efficient searching algorithm due to its better time complexity with O(log N). The  working process of binary search is simple.  1. All the elements must be in sorted order. 2. Find the MID element, compare the MID element with given Key. 3. If Key matched with MID, return. 4. If Key is less than the …

Start reading C Program to find an Element using Binary Search

C Program to Find an Element Using Linear Search

Linear Search is a process of searching given elements in sequential order.  Refer the following Articles for the detailed Example for Linear Search Linear Search Algorithm With Example is written in C++ with examples. Java Program for Linear Search C Program to Search an Array Element using LINEAR SEARCH OUTPUT: Enter the number of elements in …

Start reading C Program to Find an Element Using Linear Search

C Program to Find Reverse of a Number using Recursion

C program to reverse a number using Recursion. A function calls itself, is called a Recursion. During the recursion, all the intermediate recursive calls data will be stored in Stack data structure. The stack works with a principle of Last in First out. Flowchart for Reverse of a Number, the flowchart is not based on recursion, but you …

Start reading C Program to Find Reverse of a Number using Recursion