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:
A Guide to JUnit 5 Extensions
Java Program to Perform Inorder Non-Recursive Traversal of a Given Binary Tree
Introduction to Spring Cloud CLI
Java Program to Implement Maximum Length Chain of Pairs
REST Pagination in Spring
List Interface trong Java
Serverless Functions with Spring Cloud Function
Tránh lỗi ConcurrentModificationException trong Java như thế nào?
Tránh lỗi NullPointerException trong Java như thế nào?
Comparing Two HashMaps in Java
Java Program to Implement Hash Trie
Using Java Assertions
Spring Data JPA @Query
Java Byte Array to InputStream
Java Program to Implement Hash Tables with Double Hashing
Java Program to Describe the Representation of Graph using Incidence List
New Stream Collectors in Java 9
How to Use if/else Logic in Java 8 Streams
Truyền giá trị và tham chiếu trong java
Giới thiệu luồng vào ra (I/O) trong Java
Error Handling for REST with Spring
Guide to System.gc()
Performance Difference Between save() and saveAll() in Spring Data
Lớp HashMap trong Java
Java Program to Implement Hash Tables with Quadratic Probing
Java Program to Implement Floyd-Warshall Algorithm
Java – Combine Multiple Collections
Guide to the Java Queue Interface
Java Program to Implement RoleUnresolvedList API
Toán tử trong java
Java Program to Implement Queue using Two Stacks
Các nguyên lý thiết kế hướng đối tượng – SOLID