Monthly Archives: November 2019

hashing in c

What is hashing in data structures?

Hashing is basically used for searching a key in an array.
count sort

Count sort in C

Count sort is index based sorting algorithm. It is much faster than comparison based sorting technique but takes a lot more space.

Merge sort in C

We assume each element of the list/array as a separated list. Each single element is sorted by default so we merge down pair of elements using the merging two sorted arrays method.

Quick Sort in C

Quick sort in C C++The popular oneAlso known as Selection-exchange sort, and Partition-exchange...

Selection sort in C

Start from the first element and iterate the array to find smallest element and swap first and that element.

Insertion Sort in C

Consider first element of the array as sorted then loop through remaining elements and perform insertion like inserting an element is done in a sorted array.

Bubble Sort in C

Bubble sort is one of the comparison based sorting algorithm.

Criteria for sorting analysis in Data Structures

Number of comparisons Number of swaps Adaptive behaviour - Checking if the data structure is already sorted or completely unsorted Stable - Maintaining order of duplicate values in sorted data structure Extra memory - Space Complexity

Circular Linked List

Circular linked list is similar to simple linked list, the main difference is that the last node points to the first node and not to null.
doubly linked list

Doubly Linked List in C/C++

A doubly linked list is similar to simple linked list, the main difference is that a doubly linked list node has one extra pointer pointing to previous node.

Linked List In C/C++

Each node requires two data types, an int, char, float etc data type to store the value and a pointer to the next node to store the address of the node to which this node is pointing to.

Array as an Abstract Data Structure C/C++. (ADT)

We require a pointer to an array create it dynamically of inputed size from the user and a length of array till elements are present.

Implementation of 2D array in C

An array can be created in a matrix form with n number of rows and m no of columns by using the concept of multi dimensional array.

How to increase size of an array in C/C++ after declaration

Create a new array pointer and copy the contents of previous array pointer to this new array pointer and free/delete the previous pointer.

Basics of Array Data Structures in C/C++.

Basics of Array Data Structures in C/C++. Arrays are collection of elements stored in continuous memory locations.

Heap and heap sort

Introduction to heapHeap are complete binary tress. By complete, I mean each node except the leaf...

OOPS Lab Programs – DTU

Program 1 - Power FunctionProgram 2 - 2D PointsProgram 3- 4 Function CalculatorProgram 4-Phone Number ClassProgram 5-Meters/Centimeter to...

Smart Parking System

Smart parking system using raspberry pi or arduino. OpenCV module. TCP/IP socket connection. Android App. Image processing. IR sensors.