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:
Lớp Collections trong Java (Collections Utility Class)
Giới thiệu thư viện Apache Commons Chain
Java Program to Check if an UnDirected Graph is a Tree or Not Using DFS
Java Program to Implement Fisher-Yates Algorithm for Array Shuffling
Java Program to Implement Trie
Java InputStream to String
Configure a Spring Boot Web Application
Rest Web service: Filter và Interceptor với Jersey 2.x (P2)
Java – Reader to Byte Array
Using Custom Banners in Spring Boot
Tổng quan về ngôn ngữ lập trình java
Java Program to Implement Adjacency List
Getting Started with Stream Processing with Spring Cloud Data Flow
Jackson – Bidirectional Relationships
Java Program to Find Number of Articulation points in a Graph
Mapping a Dynamic JSON Object with Jackson
Filtering a Stream of Optionals in Java
StringBuilder vs StringBuffer in Java
Java Program to Perform Insertion in a BST
Using Spring @ResponseStatus to Set HTTP Status Code
How To Serialize and Deserialize Enums with Jackson
Rest Web service: Filter và Interceptor với Jersey 2.x (P1)
REST Web service: HTTP Status Code và xử lý ngoại lệ RESTful web service với Jersey 2.x
List Interface trong Java
Primitive Type Streams in Java 8
Date Time trong Java 8
Java Program to find the peak element of an array using Binary Search approach
Quick Guide to @RestClientTest in Spring Boot
Introduction to Spring MVC HandlerInterceptor
Tips for dealing with HTTP-related problems
Spring Boot - Hystrix
Java Program to Find Second Smallest of n Elements with Given Complexity Constraint