Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit cef65ac

Browse files
committed
fix indent and add documentation links
1 parent 3407557 commit cef65ac

File tree

2 files changed

+2
-1
lines changed

2 files changed

+2
-1
lines changed

‎Algorithms/Multiset.java‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -23,7 +23,7 @@ void remove(K key){
2323
multiSet.put(key, freq - 1);
2424
}
2525
}
26-
26+
2727
@Override
2828
public String toString(){
2929
return multiSet.toString();

‎README.md‎

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -42,6 +42,7 @@ In This Repository, I have written some of the important Algorithms and Data Str
4242
| [LIS - Longest Increasing Subsequence](https://github.com/joney000/Java-Competitive-Programming/blob/master/Algorithms/LIS_nLOGn.java)| O(N * log(N)), O(N)
4343
| [Priority Queue](https://github.com/joney000/Java-Competitive-Programming/blob/master/Algorithms/PriorityQueue.java)| O(log(N)), O(N) | N = no of objects in the queue. peek: O(1), poll/add: O(log n)
4444
| [Multiset](https://github.com/joney000/Java-Competitive-Programming/blob/master/Algorithms/Multiset.java)| O(log(N)), O(N) | N = no of objects in the multiset. get/add: O(log n) and Average Case O(1)
45+
| [MillerRabin](https://github.com/joney000/Java-Competitive-Programming/blob/master/Algorithms/MillerRabin.java)| O(log(N)), O(1) | deterministic algorithm to identify if a number is prime or not
4546

4647
## Contributions
4748

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /