66 lines
1.6 KiB
Java
66 lines
1.6 KiB
Java
package DataStructures.HashMap.Hashing;
|
|
|
|
import java.util.Scanner;
|
|
|
|
public class MainLinearProbing {
|
|
public static void main(String[] args) {
|
|
|
|
int choice, key;
|
|
|
|
HashMapLinearProbing h = new HashMapLinearProbing(7);
|
|
Scanner In = new Scanner(System.in);
|
|
|
|
while (true) {
|
|
System.out.println("Enter your Choice :");
|
|
System.out.println("1. Add Key");
|
|
System.out.println("2. Delete Key");
|
|
System.out.println("3. Print Table");
|
|
System.out.println("4. Exit");
|
|
System.out.println("5. Search and print key index");
|
|
System.out.println("6. Check load factor");
|
|
|
|
choice = In.nextInt();
|
|
|
|
switch (choice) {
|
|
case 1:
|
|
{
|
|
System.out.println("Enter the Key: ");
|
|
key = In.nextInt();
|
|
h.insertHash(key);
|
|
break;
|
|
}
|
|
case 2:
|
|
{
|
|
System.out.println("Enter the Key delete: ");
|
|
key = In.nextInt();
|
|
h.deleteHash(key);
|
|
break;
|
|
}
|
|
case 3:
|
|
{
|
|
System.out.println("Print table");
|
|
h.displayHashtable();
|
|
break;
|
|
}
|
|
case 4:
|
|
{
|
|
In.close();
|
|
return;
|
|
}
|
|
case 5:
|
|
{
|
|
System.out.println("Enter the Key to find and print: ");
|
|
key = In.nextInt();
|
|
System.out.println("Key: " + key + " is at index: " + h.findHash(key));
|
|
break;
|
|
}
|
|
case 6:
|
|
{
|
|
h.checkLoadFactor();
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|