This is a java program to perform searching based on locality of refernce. The Locality of Reference principle says that if an element of a list is accessed it might also be accessed in near future. So we store it to the front of the list.
Here is the source code of the Java Program to Perform Searching Based on Locality of Reference. The Java program is successfully compiled and run on a Windows system. The program output is also shown below.
/* * Follows recently accessed elements should be referred more so kept on top of * the list */ package com.maixuanviet.combinatorial; import java.util.LinkedList; import java.util.List; import java.util.Random; import java.util.Scanner; public class LocalityBasedSearching { public static void main(String[] args) { List<Integer> items = new LinkedList<Integer>(); Integer n = 10; Scanner sc = new Scanner(System.in); Random rand = new Random(); while (n > 0) { items.add(rand.nextInt(100)); n--; } System.out.println(items.toString()); boolean flag = true; boolean found = false; Integer numberofInstance; while (flag == true) { numberofInstance = 0; System.out.println("Enter the element to find: "); Integer search = sc.nextInt(); for (int i = 0; i < items.size(); i++) { if (items.get(i).equals(search)) { found = true; System.out.println("Element found at index " + i + "\nReordering list..."); // Integer temp = items.get(numberofInstance); // items.set(numberofInstance, search); items.add(numberofInstance, search); items.remove(i + 1); // items.set(i, temp); System.out.println("Reordered list: " + items.toString()); numberofInstance++; // break; } } if (found == false) { System.out.println("No such element found."); } System.out.println("Do you want to continue? <true>/<false>"); flag = sc.nextBoolean(); } sc.close(); } }
Output:
$ javac LocalityBasedSearching.java $ java LocalityBasedSearching [52, 94, 58, 8, 78, 0, 30, 81, 16, 58] Enter the element to find: 8 Element found at index 3 Reordering list... Reordered list: [8, 52, 94, 58, 78, 0, 30, 81, 16, 58] Do you want to continue? <true>/<false> true Enter the element to find: 58 Element found at index 3 Reordering list... Reordered list: [58, 8, 52, 94, 78, 0, 30, 81, 16, 58] Element found at index 9 Reordering list... Reordered list: [58, 58, 8, 52, 94, 78, 0, 30, 81, 16] Do you want to continue? <true>/<false> true Enter the element to find: 94 Element found at index 4 Reordering list... Reordered list: [94, 58, 58, 8, 52, 78, 0, 30, 81, 16] Do you want to continue? <true>/<false> false
Related posts:
New Features in Java 8
Java Program to Find Location of a Point Placed in Three Dimensions Using K-D Trees
Create a Custom Exception in Java
Receive email using IMAP
DynamoDB in a Spring Boot Application Using Spring Data
Java Program to Describe the Representation of Graph using Adjacency List
Hướng dẫn Java Design Pattern – Command
A Guide to Apache Commons Collections CollectionUtils
Java 8 Streams peek() API
Java Program to Implement Self Balancing Binary Search Tree
Date Time trong Java 8
Java Program to Implement TreeMap API
Guava – Join and Split Collections
New Features in Java 9
Java Program to Check whether Directed Graph is Connected using BFS
OAuth2 for a Spring REST API – Handle the Refresh Token in Angular
Java Program to Find kth Largest Element in a Sequence
Guide to the Java ArrayList
Guide to Java 8’s Collectors
Using Custom Banners in Spring Boot
Java Program to Implement Queue using Linked List
Error Handling for REST with Spring
Quick Intro to Spring Cloud Configuration
wait() and notify() Methods in Java
Java Program to implement Array Deque
A Quick Guide to Spring Cloud Consul
Filtering and Transforming Collections in Guava
Java – Write a Reader to File
Java Program to Implement Max-Flow Min-Cut Theorem
Spring Boot - Internationalization
Composition, Aggregation, and Association in Java
New Stream Collectors in Java 9