https://github.com/givensuman/lab03-exercises
https://github.com/givensuman/lab03-exercises
Last synced: 3 months ago
JSON representation
- Host: GitHub
- URL: https://github.com/givensuman/lab03-exercises
- Owner: givensuman
- Created: 2025-01-31T12:29:37.000Z (4 months ago)
- Default Branch: main
- Last Pushed: 2025-01-31T13:03:21.000Z (4 months ago)
- Last Synced: 2025-01-31T13:37:30.074Z (4 months ago)
- Language: Java
- Size: 3.91 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
There are two ways to find duplicates in a list mentioned in this document. The first involves a nested `for` loop which checks every element against every other element. This is about as inefficient as possible. It's often called the naive approach because it is generally the first solution one comes up with. There is a quirk within the question, however, that allows us to do better. Because we're only concerned with *duplicates*, each time we encounter an element we've fundamentally changed the entropy of the problem space, which the naive approach does not account for. If we use a map data structure to store elements when we encounter them, duplicates are automatically discounted when stored.
In practical terms, the naive approach is taking into consideration not only the value, but the position of the value in the list. If that information is important, it very well may be the only way to solve a problem. In this case, it isn't. Using a map requires only one iteration over the list, and because we can assume a `map` implementation has O(1) insertion and O(1) retrieval, the function runs in O(N) time. Using nested loops requires O(N) operations *for each of N elements*, meaning it runs in O(N^2) time.