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 HashMap API
Java Program to Implement Levenshtein Distance Computing Algorithm
The Spring @Controller and @RestController Annotations
Java Program to Implement Gabow Algorithm
Java Program to Implement Radix Sort
Checked and Unchecked Exceptions in Java
An Introduction to Java.util.Hashtable Class
Enum trong java
Working with Tree Model Nodes in Jackson
JPA/Hibernate Persistence Context
Abstract class và Interface trong Java
Set Interface trong Java
Exploring the Spring 5 WebFlux URL Matching
Java Program to Implement Knight’s Tour Problem
Java 9 Stream API Improvements
Java Program to Check if a Given Graph Contain Hamiltonian Cycle or Not
Java Program to Find Inverse of a Matrix
REST Pagination in Spring
Spring Data Java 8 Support
Java Program to Implement Merge Sort Algorithm on Linked List
Java Program to Implement Weight Balanced Tree
Extract links from an HTML page
Hướng dẫn sử dụng lớp Console trong java
Java Program to Implement CopyOnWriteArrayList API
Java Program to Solve the 0-1 Knapsack Problem
Spring Data JPA and Null Parameters
Java Program to Describe the Representation of Graph using Incidence Matrix
Introduction to Using Thymeleaf in Spring
Java Program to Implement Skip List
@Order in Spring
Introduction to Spring Cloud OpenFeign
Java Program to Check if a Given Binary Tree is an AVL Tree or Not