--
Searching
Algorithm
Depth First Search (DPS)
Breadth First Search (BFS)
Binary search
Linear (Brute Force)
Shortest path by Dijkstra.
using a Min-heap as priority queue
Shortest path by Dij
A Hash table is similar to a math, with a specified size. We want a Hash
function to map the key of one entry to an index of the underlying array.
A hash function maps keys of a given type to integers
Chapter 7: Lists and Iterators
Positional Lists:
To provide for a general abstraction of a sequence of elements with the
ability to identify the location of an element, we define a positional list
ADT
Chapter 9: Priority Queues
Priority Queues:
A priority queue stores a collection of entries which have priorities.
Each entry is a pair: (key, value)
Main methods of the Priority Queue ADT:
insert(k,
Merge Sort:
Divide-and-conquer paradigm. Runs in O(n log n)
Base case for the recursion is if sub-problems size = 0 | 1
You can use Trees to emulate this by splitting into nodes and leaves instead
of
Binary Search Trees:
Search tables are ordered maps implemented by means of a sorted
sequence; we store the items in an array-based sequence, sorted by key - we
use an external comparator for the keys
Co
m
pl
im
en
ts
of
Microservices
for Java Developers
A Hands-On Introduction
to Frameworks & Containers
Christian Posta
Microservices for
Java Developers
A Hands-on Introduction
to Frameworks and Con
Homework 4: Hashtables
Due 3/26/14
You will design a HashSet<T> class that is parameterized by a hashing function and a table size
(number of buckets). The hash function will be dened in terms of a ge