Insertion, Traverse and Deletion in Array part 1 |Data Structures and Algorithms|Urdu|Hindi
This is the second tutorial of Data Structures and Algorithms series in java. In this tutorial I am going to explain the problems we face when we insert data in the Array directly. Since there are a lots of problems such has if we don't insert data in sequance then it will take a lot time to access the data in array(traverse). And if we put data in Array in sequance but we want to put one more data in the index that already has data so what we will do to store the new data and don't lose the old data. In this tutorial i will explain what problem we face when we want to delete a data from an Array and how we will overcome that problem.
This tutorial consists of two part. This is the first part of insertion,traverse and deletion in Array in which i have just touched the theory section nut in second part we will make a project which will consist of two classes main.java and ArrayUtility.java. In ArrayUtility we will create our Array and Insert, Traverse and Delete method.