In this article, we are going to learn about the different sorting techniques and their implementations in C language. The following are the sorting techniques that we can implement with C language and other programming also: Bubble Sort Insertion Sort Selection Sort Merge Sort Shell Sort Heap Sort Bucket ... Read More

strtok_r() function in C language The strtok_r() function is similar to the strtok() function. The only key difference is that the _r, which is called as re-entrant function. A re-entrant function is a function which can be interrupted during its execution. This type of function can be used to ... Read More

Depth First Search (DFS) is an algorithm which traverses a graph and visits all nodes before coming back it can determine. Also, it determines whether a path exist between two nodes. It searches a graph or tree in depth-wise manner. Algorithm Given below is an algorithm for the implementation of ... Read More

A file represents a sequence of bytes, regardless of it being a text file or a binary file. File is collection of records or is a place on hard disk, where data is stored permanently. Operations on files The operations on files in C programming language are as follows − ... Read More

File is collection of records or is a place on hard disk, where data is stored permanently. Operations on files The operations on files in C programming language are as follows − Naming the file Opening the file Reading from the file ... Read More

File is collection of records or is a place on hard disk, where data is stored permanently.Operations on filesThe operations on files in C programming language are as follows −Naming the fileOpening the fileReading from the fileWriting into the fileClosing the fileSyntaxThe syntax for opening a file is as follows ... Read More

Stack is a linear data structure, where data is inserted and removed only at one end.AlgorithmsGiven below is an algorithm for Push ( ) −Check for stack overflow.if (top = = n-1) printf("stack over flow");Otherwise, insert an element into the stack.top ++ a[top] = itemGiven below is an algorithm for ... Read More

Stack is a linear data structure, where data is inserted and removed only at one end.AlgorithmsGiven below is an algorithm for Push ( ) −Check for stack overflow.if (top = = n-1) printf("stack over flow");Otherwise, insert an element into the stack.top ++ a[top] = itemGiven below is an algorithm for ... Read More

Linked lists use dynamic memory allocation i.e. they grow and shrink accordingly. They are defined as a collection of nodes. Here, nodes have two parts, which are data and link. The representation of data, link and linked lists is given below −Operations on linked listsThere are three types of operations ... Read More

In C programming language, the Control statements are used to repeat a set of statements.They are as follows −for loopwhile loopdo-while loopIn for loop and while loop, the condition specifies the number of times, in which a loop can be executed.Example for the for loopfor (k = 1; k