Index Name C CoffeeScript Cplusplus CSharp Java JavaScript PHP Python Ruby Activity Selection ✖️ ✖️ ✔️ ✖️ ✔️ ✖️ ✖️ ✖️ ✖️ Bellman Ford ✖️ ✖️ ✔️ ✖️ ✖️ ✖️ ✖️ ✖️ ✖️ Binary Search ✖️ ✔️ ✔️ ✔️ ✔️ ✔️ ✔️ ✔️ ✔️ Binary Search Tree ✔️ ✖️ ✔️ ✔️ ✔️ ✖️ ✖️ ✔️ ✖️ Breadth First Search ✖️ ✖️ ✔️ ✖️ ✔️ ✖️ ✖️ ✔️ ✖️ Bubble Sort ✖️ ✔️ ✔️ ✔️ ✔️ ✔️ ✔️ ✔️ ✖️ Chinese Remainder Theorem ✖️ ✔️ ✔️ ✔️ ✔️ ✖️ ✖️ ✔️ ✖️ Circular Linked List ✖️ ✖️ ✔️ ✖️ ✖️ ✖️ ✖️ ✖️ ✖️ Counting Sort ✖️ ✔️ ✔️ ✔️ ✔️ ✔️ ✔️ ✔️ ✖️ Depth First Search ✖️ ✖️ ✔️ ✖️ ✖️ ✖️ ✖️ ✔️ ✖️ Dijkstra Algorithm ✖️ ✖️ ✔️ ✔️ ✖️ ✖️ ✖️ ✔️ ✖️ Euclidean Algorithm ✖️ ✔️ ✔️ ✔️ ✔️ ✖️ ✔️ ✔️ ✖️ Extended Euclidean Algorithm ✖️ ✔️ ✖️ ✔️ ✖️ ✖️ ✖️ ✔️ ✖️ Fermat Little Theorem ✖️ ✔️ ✔️ ✖️ ✖️ ✖️ ✖️ ✔️ ✔️ Floyd Warshall Algorithm ✖️ ✖️ ✔️ ✖️ ✔️ ✖️ ✖️ ✖️ ✖️ Ford Fulkerson Method ✖️ ✖️ ✔️ ✖️ ✖️ ✖️ ✖️ ✖️ ✖️ Heap Sort ✖️ ✖️ ✔️ ✔️ ✔️ ✖️ ✖️ ✔️ ✖️ Inorder Traversal ✖️ ✖️ ✔️ ✖️ ✔️ ✖️ ✖️ ✔️ ✖️ Insertion Sort ✖️ ✔️ ✔️ ✔️ ✔️ ✖️ ✖️ ✔️ ✔️ Interpolation Search ✖️ ✔️ ✖️ ✔️ ✔️ ✖️ ✔️ ✔️ ✖️ Kadane Algorithm ✖️ ✔️ ✔️ ✔️ ✔️ ✖️ ✖️ ✔️ ✖️ Knapsack Problem ✖️ ✖️ ✔️ ✖️ ✖️ ✖️ ✖️ ✖️ ✖️ Knuth Morris Pratt (KMP) Algorithm ✖️ ✖️ ✔️ ✔️ ✖️ ✖️ ✖️ ✔️ ✖️ Kruskal Algorithm ✖️ ✖️ ✔️ ✖️ ✔️ ✖️ ✖️ ✖️ ✖️ Levelorder Traversal ✖️ ✖️ ✔️ ✖️ ✔️ ✖️ ✖️ ✔️ ✖️ Linear Search ✖️ ✔️ ✔️ ✔️ ✔️ ✖️ ✔️ ✔️ ✔️ Linked List ✔️ ✖️ ✔️ ✖️ ✔️ ✖️ ✖️ ✔️ ✖️ Logarithmic Exponent ✖️ ✔️ ✔️ ✖️ ✖️ ✖️ ✖️ ✔️ ✖️ Matrix Chain Multiplication ✖️ ✖️ ✔️ ✖️ ✖️ ✖️ ✖️ ✖️ ✖️ Merge Sort ✖️ ✔️ ✔️ ✖️ ✔️ ✖️ ✖️ ✔️ ✖️ Merge Sort with Inertion Sort ✖️ ✔️ ✔️ ✖️ ✖️ ✖️ ✖️ ✔️ ✖️ Naive String Matching ✖️ ✔️ ✔️ ✖️ ✔️ ✖️ ✔️ ✔️ ✖️ Postorder Traversal ✖️ ✖️ ✔️ ✖️ ✔️ ✖️ ✖️ ✔️ ✖️ Preorder Traversal ✖️ ✖️ ✔️ ✖️ ✔️ ✖️ ✖️ ✔️ ✖️ Prims Algorithm ✖️ ✖️ ✔️ ✖️ ✖️ ✖️ ✖️ ✖️ ✖️ Queue_Using_Arrays ✔️ ✖️ ✔️ ✖️ ✖️ ✖️ ✖️ ✔️ ✖️ Queue_Using_Linked_List ✖️ ✖️ ✔️ ✖️ ✖️ ✖️ ✖️ ✖️ ✖️ Queue_Using_Stacks(Dequeue) ✖️ ✖️ ✖️ ✖️ ✔️ ✖️ ✖️ ✖️ ✖️ Queue_Using_Stacks(Enqueue) ✖️ ✖️ ✖️ ✖️ ✔️ ✖️ ✖️ ✖️ ✖️ Quick Sort ✖️ ✔️ ✔️ ✖️ ✔️ ✖️ ✖️ ✔️ ✖️ Quick Sort 3-way ✖️ ✖️ ✔️ ✖️ ✖️ ✖️ ✖️ ✔️ ✖️ Radix Sort ✖️ ✔️ ✔️ ✖️ ✔️ ✖️ ✖️ ✔️ ✖️ Reversal Linked List ✔️ ✖️ ✔️ ✖️ ✔️ ✖️ ✖️ ✖️ ✖️ Rod Cutting Problem ✖️ ✖️ ✔️ ✔️ ✔️ ✔️ ✔️ ✔️ ✖️ Segment Tree(RMQ) ✖️ ✖️ ✔️ ✖️ ✔️ ✖️ ✖️ ✔️ ✖️ Selection Sort ✖️ ✔️ ✔️ ✔️ ✔️ ✖️ ✖️ ✔️ ✔️ Shell Sort ✖️ ✔️ ✔️ ✖️ ✔️ ✖️ ✖️ ✔️ ✖️ Sieve Of Eratosthenes ✖️ ✔️ ✔️ ✖️ ✔️ ✖️ ✖️ ✔️ ✖️ Sleep Sort ✔️ ✔️ ✔️ ✖️ ✔️ ✖️ ✖️ ✔️ ✖️ Stack using arrays ✖️ ✖️ ✔️ ✖️ ✔️ ✖️ ✖️ ✔️ ✖️ Stack using Linked list ✖️ ✖️ ✔️ ✖️ ✔️ ✖️ ✖️ ✔️ ✖️ Stack using Queues(Efficient Dequeue) ✖️ ✖️ ✖️ ✖️ ✔️ ✖️ ✖️ ✖️ ✖️ Stack using Queues(Efficient Enqueue) ✖️ ✖️ ✖️ ✖️ ✔️ ✖️ ✖️ ✖️ ✖️ Ternary Search ✖️ ✔️ ✔️ ✖️ ✔️ ✖️ ✖️ ✔️ ✖️ Trie for natural numbers ✖️ ✖️ ✔️ ✖️ ✖️ ✖️ ✖️ ✖️ ✖️ Trie for words ✖️ ✖️ ✔️ ✖️ ✖️ ✖️ ✖️ ✖️ ✖️ Z Algorithm ✖️ ✔️ ✔️ ✖️ ✖️ ✖️ ✖️ ✔️ ✖️