This Java program is to Implement Vector. The elements of a vector are stored contiguously.Like all dynamic array implementations, vectors have low memory usage and good locality of reference and data cache utilization
Here is the source code of the Java program to implement vector. The Java program is successfully compiled and run on a Linux system. The program output is also shown below.
import java.util.ArrayList;
import java.util.Scanner;
public class Vector<T>
{
private int capacity;
private int size;
private ArrayList<T> vector;
private static final int INCREMENT_FACTOR = 5;
public Vector(int size)
{
this.size = size;
this.capacity = size + INCREMENT_FACTOR;
vector = new ArrayList<T>();
}
public void store(int index, T value)
{
try
{
vector.set(index, value);
} catch (IndexOutOfBoundsException indexOutBounds)
{
if (index >= 0 && (index < size))
{
vector.add(index, value);
}
if (index >= 0 && (index >= size && index < capacity))
{
vector.add(index, value);
size = index + 1;
if (size == capacity)
capacity = capacity + INCREMENT_FACTOR;
}
if (index >= capacity)
{
throw new IndexOutOfBoundsException();
}
}
}
public T get(int index)
{
try
{
return vector.get(index);
} catch (IndexOutOfBoundsException indexOutBounds)
{
}
return null;
}
public int getSize()
{
return size;
}
public int getCapacity()
{
return capacity;
}
public static void main(String... arg)
{
int size;
int num;
int value;
Scanner scanner = new Scanner(System.in);
System.out.println("Enter the initial size of the vector");
size = scanner.nextInt();
Vector<Integer> vector = new Vector<>(size);
System.out.println("Enter the number of elements ");
num = scanner.nextInt();
System.out.println("Enter the values");
for (int index = 0; index < num; index++)
{
value = scanner.nextInt();
vector.store(index, value);
}
System.out.println("The Entered Values are");
for (int index = 0; index < vector.getSize(); index++)
{
System.out.print(vector.get(index) + "\t");
}
System.out.println("\nTHE SIZE OF THE VECTOR IS " + vector.getSize());
System.out.println("THE CAPACITY OF THE VECTOR IS " + vector.getCapacity());
scanner.close();
}
}
$javac Vector.java $java Vector Enter the initial size of the vector 5 Enter the number of elements 5 Enter the values 10 9 8 7 6 The Entered Values are 10 9 8 7 6 THE SIZE OF THE VECTOR IS 5 THE CAPACITY OF THE VECTOR IS 10
Related posts:
Java Program to Implement Quick Sort with Given Complexity Constraint
Cachable Static Assets with Spring MVC
LinkedHashSet trong java
Guide to the Java Clock Class
An Intro to Spring Cloud Security
Spring Boot - Unit Test Cases
Hướng dẫn Java Design Pattern – Null Object
Java 8 Predicate Chain
The StackOverflowError in Java
Java program to Implement Tree Set
Java Web Services – Jersey JAX-RS – REST và sử dụng REST API testing tools với Postman
Wrapper Classes in Java
Guide to the ConcurrentSkipListMap
Java Program to Implement JobStateReasons API
@DynamicUpdate with Spring Data JPA
The Java 8 Stream API Tutorial
Java Program to Implement Knapsack Algorithm
Hướng dẫn Java Design Pattern – Object Pool
Từ khóa static và final trong java
Spring Boot - Admin Client
Java Program to Implement Bellman-Ford Algorithm
Java Program to Implement Stein GCD Algorithm
Java Program to Implement WeakHashMap API
Check If Two Lists are Equal in Java
Converting Iterator to List
“Stream has already been operated upon or closed” Exception in Java
Giới thiệu java.io.tmpdir
Java Program to Perform Search in a BST
Java Program to Apply DFS to Perform the Topological Sorting of a Directed Acyclic Graph
Programmatic Transaction Management in Spring
Java Program to Implement Strassen Algorithm
Java Program to Implement the One Time Pad Algorithm