Scribd
Upload
30 views

Java Program Deals With All Operat

The document describes a DynamicArray class that implements a dynamic array data structure in Java. The class uses private variables to track the underlying array, element count, and capacity. Methods like add(), growSize(), and shrinkSize() allow dynamically adding and removing elements and resizing the array capacity as needed. The main method demonstrates using the DynamicArray by adding, removing, and searching elements with different test cases.

Uploaded by

naomikoyana099
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
30 views

Java Program Deals With All Operat

The document describes a DynamicArray class that implements a dynamic array data structure in Java. The class uses private variables to track the underlying array, element count, and capacity. Methods like add(), growSize(), and shrinkSize() allow dynamically adding and removing elements and resizing the array capacity as needed. The main method demonstrates using the DynamicArray by adding, removing, and searching elements with different test cases.

Uploaded by

naomikoyana099
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
You are on page 1/ 5

// Java program deals with all operation of a dynamic array

// add, remove, resize memory of array is the main feature


public class DynamicArray {

// create three variable array[] is a array,


// count will deal with no of element add by you and
// size will with size of array[]
private int array[];
private int count;
private int size;
// constructor initialize value to variable

public DynamicArray()
{
array = new int[1];
count = 0;
size = 1;
}
// function add an element at the end of array

public void add(int data)


{

// check no of element is equal to size of array


if (count == size) {
growSize(); // make array size double
} // insert element at end of array
array[count] = data;
count++;
}

// function makes size double of array


public void growSize()
{

int temp[] = null;


if (count == size) {

// temp is a double size array of array


// and store array elements
temp = new int[size * 2];
{
for (int i = 0; i < size; i++) {
// copy all array value into temp
temp[i] = array[i];
}
}
}

// double size array temp initialize


// into variable array again
array = temp;

// and make size is double also of array


size = size * 2;
}

// function shrink size of array


// which block unnecessary remove them
public void shrinkSize()
{
int temp[] = null;
if (count > 0) {

// temp is a count size array


// and store array elements
temp = new int[count];
for (int i = 0; i < count; i++) {

// copy all array value into temp


temp[i] = array[i];
}

size = count;

// count size array temp initialize


// into variable array again
array = temp;
}
}
// function add an element at given index

public void addAt(int index, int data)


{
// if size is not enough make size double
if (count == size) {
growSize();
}

for (int i = count - 1; i >= index; i--) {

// shift all element right


// from given index
array[i + 1] = array[i];
}

// insert data at given index


array[index] = data;
count++;
}

// function remove last element or put


// zero at last index
public void remove()
{
if (count > 0) {
array[count - 1] = 0;
count--;
}
}

// function shift all element of right


// side from given index in left
public void removeAt(int index)
{
if (count > 0) {
for (int i = index; i < count - 1; i++) {
// shift all element of right
// side from given index in left
array[i] = array[i + 1];
}
array[count - 1] = 0;
count--;
}
}

public static void main(String[] args)


{
DynamicArray da = new DynamicArray();

// add 9 elements in array


da.add(1);
da.add(2);
da.add(3);
da.add(4);
da.add(5);
da.add(6);
da.add(7);
da.add(8);
da.add(9);

// print all array elements after add 9 elements


System.out.println("Elements of array:");
for (int i = 0; i < da.size; i++) {
System.out.print(da.array[i] + " ");
}

System.out.println();

// print size of array and no of element


System.out.println("Size of array: " + da.size);
System.out.println("No of elements in array: "
+ da.count);

// shrinkSize of array
da.shrinkSize();

// print all array elements


System.out.println("Elements of array "
+ "after shrinkSize of array:");
for (int i = 0; i < da.size; i++) {
System.out.print(da.array[i] + " ");
}
System.out.println();

// print size of array and no of element


System.out.println("Size of array: " + da.size);
System.out.println("No of elements in array: "
+ da.count);

// add an element at index 1


da.addAt(1, 22);

// print Elements of array after adding an


// element at index 1
System.out.println("Elements of array after"
+ " add an element at index 1:");
for (int i = 0; i < da.size; i++) {
System.out.print(da.array[i] + " ");
}

System.out.println();

// print size of array and no of element


System.out.println("Size of array: " + da.size);
System.out.println("No of elements in array: "
+ da.count);

// delete last element


da.remove();

// print Elements of array after delete last


// element
System.out.println("Elements of array after"
+ " delete last element:");
for (int i = 0; i < da.size; i++) {
System.out.print(da.array[i] + " ");
}

System.out.println();

// print size of array and no of element


System.out.println("Size of array: " + da.size);
System.out.println("No of elements in array: "
+ da.count);

// delete element at index 1


da.removeAt(1);

// print Elements of array after delete


// an element index 1
System.out.println("Elements of array after"
+ " delete element at index 1:");
for (int i = 0; i < da.size; i++) {
System.out.print(da.array[i] + " ");
}
System.out.println();

// print size of array and no of element


System.out.println("Size of array: " + da.size);
System.out.println("No of elements in array: "
+ da.count);
}
}

Output
Elements of array : 1 2 3 4 5 6 7 8 9 10 11
No of elements in array : 11, Capacity of array :16

Capacity of array after shrinking : 11

After inserting at index 3


Elements of array : 1 2 3 50 4 5 6 7 8 9 10 11
No of elements in array : 12, Capacity of array :22

After delete last element Elements of array : 1 2 3 50 4 5 6 7 8 9 10


No of elements in array : 11, Capacity of array :11

After deleting at index 3 Elements of array : 1 2 3 4 5 6 7 8 9 10


No of elements in array : 10, Capacity of array :11

Searching 5 in array Element found at index : 4

You might also like