## Difference between Calloc and Malloc | Calloc() vs. Malloc()

Calloc() Malloc() Calloc initializes the allocated memory to Null or Zero. Malloc initializes the allocated memory area with garbage value. Block of memory is allocated by Calloc(). Byte of memory…

## Difference between Tree and Binary Tree | General Tree vs. Binary Tree

Difference between Tree and Binary Tree General Tree Binary Tree A general tree is a data structure in that each node can have infinite number of children, A Binary…

## Asymptotic Notation | Asymptotic Notation in Data Structure

Asymptotic Notation Asymptotic notation is a way of expressing the cost of an algorithm. Goal of Asymptotic notation is to simplify Analysis by getting rid of unneeded information Following are…

## Selection Sort | Pseudo Code of Selection Sort | Selection Sort in Data Structure

Selection Sort follows very simple idea. Let us see what is the idea of Selection Sort : First it finds the smallest element in the array. Exchange that smallest element…

## Insertion Sort | Pseudo Code of Insertion Sort | Insertion Sort in Data Structure

Insertion Sort is an efficient algorithm for sorting a small number of elements. It is similar to sort a hand of playing cards. Playing a card is one of the…

## What is an algorithm? | Define algorithm | Explain how you can judge an algorithm to be a good one?

Algorithm can be defined as an outline of the essence of procedure represented in step by step instructional manner. When you implement this algorithm using any programming language, then it…