LinkedList Insertion at any position
Algorithm INPUT: HEADER IS A POINTER TO THE HEADER NODE OF THE LINKEDLIST AND X IS THE ELEMENT TO BE INSERTEDOUTPUT: LINKEDLIST WITH THE ADDED ELEMENTDATA STRUCTURE: SINGLY LINKEDLIST Code Output
DSA
LinkedList Insertion at the End
Stepwise algorithm for inserting element at the end of a Linkedlist INPUT: HEADER IS A POINTER TO THE HEADER NODE OF THE LINKEDLIST AND X IS THE ELEMENT TO BE INSERTEDOUTPUT: LINKEDLIST WITH THE ADDED ELEMENTDATA STRUCTURE: SINGLY LINKEDLIST The given pseudocode represents the process of appending a new node to the end of a
LinkedList Insertion at Beginning
Algorithm INPUT: HEADER IS A POINTER TO THE HEADER NODE OF THE LINKEDLIST AND X IS THE ELEMENT TO BE INSERTEDOUTPUT: LINKEDLIST WITH THE ADDED ELEMENT DATA STRUCTURE: SINGLY LINKEDLIST Code Output
Linkedlist Traversal
Algorithm INPUT: HEADER is a pointer to the header node of the linkedlistOUTPUT: Prints all the elements of the linkedlistDATA STRUCTURE: Singly Linkedlist Code Output
Array Matrix Multiplication: How to perform Matrix multiplication using a 2D Array.
Learn 2D array manipulation and perform Matrix Multiplication in 2D Array. Learn Matrix multiplication by reading this blog, get the Algorithm and the code! Algorithm Code Output Click here to get the algorithm and the code for merging two arrays. Click here to get the algorithm and the code for inserting elements in an array.
Array Matrix Multiplication: How to perform Matrix multiplication using a 2D Array. Read More »