Merge Sort

Here, We will discuss about Merge Sort in C, their algorithm, implementation code in C, time and space complexity, and their applications. What is Merge Sort? Merge Sort is a divide and conquer algorithms based on the idea of breaking down a list into several sub-lists. The algorithm starts breaking down a list into sub-lists …

Merge Sort Read More »

Quick Sort

Here, We will discuss about Quick sort in C, their algorithm, implementation in C, time & space complexity and their applications. What is Quick Sort? Quick Sort is one of the famous comparison-based sorting algorithms based on divide and conquers algorithmic technique. It uses recursive calls for sorting the element. The algorithm starts by picking …

Quick Sort Read More »

Sorting Algorithms

Here, We will learn about sorting algorithms, why is sorting necessary, classification and complexity of sorting, types of sort. What is Sorting? Sorting refers to arranging data in a particular format. Sorting Algorithm is an algorithm that arranges the elements in a certain order [either ascending or descending]. The output is reordering of the input. …

Sorting Algorithms Read More »

Iterative Algorithms

Here, We will learn about the iterative algorithm, iteration, implementation and properties of iteration. Iterative Algorithms: An Iterative Algorithm that calls repeatedly but for a finite number of times. It use constructs like loops and sometime other data structures like stacks and queues to solve the problems. Iteration is a technique in which function call …

Iterative Algorithms Read More »

Recursive Algorithms

Here, We will learn about recursive algorithm, recursion, recursive function, implementation, properties and examples of recursion. Recursive Algorithms: A Recursive Algorithm that calls itself repeatedly until a base condition is satisfied. Recursion is a technique in which function calls itself. A recursive method that solves a problem by calling a copy of itself to work …

Recursive Algorithms Read More »

Analysis of Algorithms

Algorithms Analysis help us to determine which algorithms are more efficient. Types of analysis:-Worst, Best, Average. How to Compare two Algorithms? Algorithm Complexity – Space Complexity, Time Complexity, Runtime Analysis of algorithms

Introduction to Algorithms

Algorithms are a series of steps or rules for solving a computational problem. Here we learn categories, characteristics of algorithms, how to write algorithms with help of examples like write algorithm for the addition of two numbers

Number System

Numbers is one of the most important topics required for competitive entrance exams. It has been observed that Question paper has 20-30% question on number system. Classification of Numbers/Integers 1. Real Number: Real Number are classified into rational and irrational numbers. Rational Numbers: A number that can be expressed in the p/q where p and …

Number System Read More »

Welcome Coder

Welcome to the World of Data. We start sharing knowledge and ideas about tech and technology. We already share my knowledge in data structure and working on algorithms. Go and Explore more interesting contents. We are planning to bring coding question and solutions of coding questions from various platform like HackerRank, HackerEarth, LeetCode etc…