In this ever changing world of technology there are obvious questions on the survival of a technology in the coming years but as very well said by Mark

Library functions are inbuilt functions provided by the compilers. These library functions can be easily accessed by importing the particular header file which contains the library function. Similarly, there are

A string is basically a character array which terminates with a ‘\0’. It can have alphabets in both cases, digits and special characters. It is like having a

Arrays are passed to the functions as arguments. Like variables, a whole array can be passed to a function. We already know that functions make it so easy for us to

Radix Sort is a non-comparative sorting algorithm with asymptotic complexity O(nd). It is one of the most efficient and fastest linear sorting algorithms. Radix sort was developed to

Pointers are variables that contain the memory address of another variable. It enables the programmer to directly access the memory location and hence the value stored at it.

Counting Sort is a linear sorting algorithm with asymptotic complexity O(n+k), which was found by Harold Seward in 1954. Counting Sort is very time efficient and stable algorithm

Recursion is a process of calling a function within the same function again and again till the condition is satisfied. We have already seen how functions can be

An important feature of C programming(and almost every other programming language) is that it allows us to create our own functions. In this tutorial, we will be focusing