Joseph Jang
Reputation: 33
Why is TreeSet.remove's time complexity O(in N)?
A treeset is already sorted... so why isn't the time complexity to remove an object O(Log N) through binary search? Am I missing something?
Upvotes: 0
Views: 813
Answers (1)
Hulk
Reputation: 6573
It is O(log N) according to the JavaDocs for TreeSet:
This implementation provides guaranteed log(n) time cost for the basic operations (add, remove and contains).
Upvotes: 1
Related Questions
- Analyzing open windows by title in powershell/batch
- Change powershell Title on every command
- Set window title when running "start powershell" in powershell not working?
- How to start powershell with a window title?
- Powershell - Get current Active Window title and set it as a string
- How to change UI title in PowerShell when starting a new process
- PowerShell - How to use 'Start-Process' and rename the newly launched windowtitle
- Dynamically rename a command prompt window title via Powershell
- PowerShell: Kill and message prompt by window title
- PowerShell - Loop while MainWindowTitle not found