Java Program to Implement vector

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:

Spring MVC Tutorial
Abstract class và Interface trong Java
Java Program to Construct a Random Graph by the Method of Random Edge Selection
Java Program to Implement HashMap API
Introduction to Spring Data REST
Introduction to Spliterator in Java
JUnit5 @RunWith
Netflix Archaius with Various Database Configurations
Check if there is mail waiting
Java Program to Implement Lloyd’s Algorithm
Tạo chương trình Java đầu tiên sử dụng Eclipse
Spring Boot - Tomcat Deployment
REST Web service: HTTP Status Code và xử lý ngoại lệ RESTful web service với Jersey 2.x
Java Program to Generate All Subsets of a Given Set in the Lexico Graphic Order
Java Program to Implement Levenshtein Distance Computing Algorithm
Một số từ khóa trong Java
Rest Web service: Filter và Interceptor với Jersey 2.x (P1)
Guide to CopyOnWriteArrayList
An Introduction to ThreadLocal in Java
Spring Security and OpenID Connect
StringBuilder vs StringBuffer in Java
Java Program to Implement Double Order Traversal of a Binary Tree
Hướng dẫn sử dụng biểu thức chính quy (Regular Expression) trong Java
Java Program to Implement CountMinSketch
Java Program to Implement Floyd-Warshall Algorithm
Phương thức forEach() trong java 8
Prevent Cross-Site Scripting (XSS) in a Spring Application
A Comparison Between Spring and Spring Boot
Java Program to Implement Gauss Jordan Elimination
Check if a String is a Palindrome in Java
The HttpMediaTypeNotAcceptableException in Spring MVC
Hướng dẫn Java Design Pattern – Decorator