How to Implement a Circular Queue in Java ?

How to Implement an Array with Constant-Time Random Access in Java?

Last Updated : 23 Dec, 2024

In Java, random access in arrays requires direct index-based addressing, it usually takes constant time, or O(1). Standard arrays in Java provide random access that is constant in time.

Note: The term constant-time random access means accessing an element by index, it takes the same amount of time irrespective of the size of the array.
Using index-based addressing is the essential idea for obtaining constant-time random access.
Arrays in Java are stored in contiguous memory locations, and accessing an element in an array is easy i.e. by calculating its index.

Array with Constant-Time Random Access Implementation

Java

import java.util.Arrays;

public class ConstantTimeRandomAccess 
{
    public static void main(String args[]) 
    {
        int[] arr = {20, 40, 60, 60, 100};

        // Access elements using indices (constant-time random access)
        int ele2 = arr[2];
        int ele4 = arr[4];

        // Print the results
        System.out.println("Element at index 2: " + ele2);
        System.out.println("Element at index 4: " + ele4);
    }
}

Output

Element at index 2: 60
Element at index 4: 100

Explanation of the Program:

An array of integers named numbers is created and initialized with values.
Elements of the array are accessed index-based, and it demonstrates constant-time random access.
The values of elements at indices 2 and 4 are printed to the console.

How to Implement a Circular Queue in Java ?

R

ravi86526iv

Improve

Article Tags :

Practice Tags :

Java

Similar Reads

Delete the Element in Array with Constant Time in Java

In Java, arrays are a basic data structure. Dynamic operations like Insertion and Deletion are costly due to their constant size. We can accomplish constant-time deletion operations by combining arrays and linked lists.Program to Implement Constant-Time Deletion Operations in an Array in JavaThere a

Array with Constant Time Insertions and Deletions in Java

A Circular Buffer is a kind of data structure that allows for insertions and deletions at both the front and back ends of the buffer in constant time. It does this by arranging the components in a circle.Constant Time Insertions and Deletions of ArrayKeeping two pointers front and rear and using the

How to Implement a Thread-Safe Resizable Array in Java?

Multiple threads may securely execute operations like insertion and deletion without risking data corruption when utilizing a thread-safe resizable array. The ArrayList class is a popular Java class, yet it is not thread-safe by default. We may use concurrent collections or synchronization to make i

How to Add Random Number to an Array in Java?

To generate an array of integers with random values the nextInt() method from the java.util.Random class is used. From the random number generator sequence, this method returns the next random integer value.Assigning a Random Value to an ArrayWe can assign random values to an array by two approaches

How to Implement a Circular Queue in Java ?

A Circular Queue is a queue in which we can insert an element at the start of the Array even if our rare is reached at the last index and if we have space at the start of the array. This reduces the problem of inefficient use of array space. Once the array is filled till the last and if we have spac

How to Implement a Cache Eviction Policy using TreeMap in Java?

To enhance application speed, caching is a method that stores frequently visited data in memory. When the cache fills up, a cache eviction policy decides which things must be removed. A sorted map implementation is provided by Java's TreeMap, which may be used to create a cache with a unique evictio

How to Add an Element at Particular Index in Java ArrayList?

ArrayList.add() method is used to add an element at particular index in Java ArrayList. Syntax: public void add(int index, Object element) ; Parameters: index -position at which the element has to be inserted. The index is zero-based.element - the element to be inserted at the specified position. Ex

How to Convert an ArrayList or an Array into a TreeSet in Java?

In Java, ArrayList allows random access because it works like an array. It means you can access any element by its index in O(1) at any time. A TreeSet is a sorted set implementation of the Set interface based on a TreeMap. It provides log(n) time complexity for basic operations like add, remove, an

How to Fill (initialize at once) an Array in Java?

An array is a group of like-typed variables that are referred to by a common name. In this, article we will learn about Filling array in Java while Initialization.Example:Java// Java program to fill the element in an array import java.util.*; public class Geeks { public static void main(String args[

How to Declare an ArrayList with Values in Java?

ArrayList is simply known as a resizable array. Declaring an ArrayList with values is a basic task that involves the initialization of a list with specific elements. It is said to be dynamic as the size of it can be changed. Proceeding with the declaration of ArrayList, we have to be aware of the co