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

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

Quick Sort in C

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

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

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

Bubble Sort in C

Bubble sort is one of the comparison based sorting algorithm.
top-13-oop-programs-with-output

Top 13 OOP Lab Programs With Programs And Output

Object-oriented programming (OOP) is a computer programming model that organizes software design around data, or objects, rather than functions and logic. Following are the list of top 13 OOP programs with code and output to have a better understanding of OOP.