five-minutes-algorithms

Basic algorithms everybody should solve in 5 minutes in the interview.(some in the file are a littel bit complex, just skip it)

If you find any bugs or you think some other simple algorithms need to be added, feel free to submit a pull request.

====================

Name		Name	Last commit message	Last commit date
Latest commit History 107 Commits
advanced		advanced
1.txt		1.txt
BigInteger.cpp		BigInteger.cpp
CircularQueue.cpp		CircularQueue.cpp
ClosestPairOfPoint.cpp		ClosestPairOfPoint.cpp
CombinationPermutation.cpp		CombinationPermutation.cpp
DP.cpp		DP.cpp
FindMajority.cpp		FindMajority.cpp
Graph.cpp		Graph.cpp
HashTable.cpp		HashTable.cpp
HashTableLinkedList.cpp		HashTableLinkedList.cpp
HeapMaintainMedian.cpp		HeapMaintainMedian.cpp
HeapSort_Priority_queue.cpp		HeapSort_Priority_queue.cpp
Heap_Sort.cpp		Heap_Sort.cpp
Heap_Sort_Big.cpp		Heap_Sort_Big.cpp
HighFrequency.cpp		HighFrequency.cpp
LinkedList.cpp		LinkedList.cpp
LinkedListUsingArray.cpp		LinkedListUsingArray.cpp
QueueUsingStack.cpp		QueueUsingStack.cpp
README.md		README.md
RedBlackTree.cpp		RedBlackTree.cpp
ReferenceCount.cpp		ReferenceCount.cpp
Search.cpp		Search.cpp
SegmentTree.cpp		SegmentTree.cpp
ShortestPathDijkstra.cpp		ShortestPathDijkstra.cpp
ShortestPathFloyd.cpp		ShortestPathFloyd.cpp
Sorting.cpp		Sorting.cpp
StackUsingQueue.cpp		StackUsingQueue.cpp
StackWithMin.cpp		StackWithMin.cpp
String.cpp		String.cpp
Tree.cpp		Tree.cpp
UnionFind.cpp		UnionFind.cpp
bst_in.txt		bst_in.txt
code_on_paper.ppt		code_on_paper.ppt
input.txt		input.txt
test.cpp		test.cpp
uf.txt		uf.txt

Provide feedback