Algorithms

Algorithms 

1. Linear Regression
2. Logistic Regression
3. Decision Trees
4. Neural Network
5. Support Vector Machine
6. ANOVA
7. Time Series Analysis
8. K-means clustering
9. Principal Component Analysis.

Big-O Notation, Sorting And Searching Algorithms

• Performance and Complexity 
• Big O Notation 
• Big O Notation More Examples 
• Sorting Trade-Offs 
• Selection Sort 
• Bubble Sort 
• Insertion Sort 
• Shell Sort 
• Merge Sort 
• Quick Sort 
• Binary Search - search quickly through a sorted list 

Stacks And Queues

1. Meet The Stack - Simple But Powerful 
2. Building A Stack Using Java 
3. Match Parenthesis To Check A Well Formed Expression 
4. Find The Minimum Element In A Stack In Constant Time 
5. Meet The Queue - A Familiar Sight In Everyday Life 
6. The Circular Queue - Tricky But Fast 
7. Build A Queue With Two Stacks

Binary Trees

• Meet The Binary Tree - A Hierarchical Data Structure 

• Breadth First Traversal 
• Depth First - Pre-OrderTraversal 
• Depth First - In-Order and Post-Order Traversal 

Binary Search Trees

• The Binary Search Tree - an introduction 
• Insertion and Lookup in a Binary Search Tree 
• Binary Tree Problems
• Minimum Value, Maximum Depth And Mirror 
• Count Trees, Print Range and Is BST 
• Has Path Sum, Print Paths, Least Common Ancestor 

Heaps

• The Heap Is Just The Best Way to Implement a Priority Queue 
• Meet The Binary Heap - It's A Tree At Heart 
• The Binary Heap - Logically A Tree Really An Array 
• The Binary Heap - Making It Real With Code 
• Heapify! 
• Insert And Remove From A Heap 
• Revisiting Sorting - The Heap Sort
• Heap Sort Phase I - Heapify 
• Heap Sort Phase II - The Actual Sort 
• Heap Problems
• Maximum Element In A Minimum Heap and K Largest Elements In A Stream 
• Merge K Sorted Lists Into One Sorted List Using A Heap 
• Find The Median In A Stream Of Elements 

Graphs

1. Introducing The Graph 
2. Types Of Graphs 
3. The Directed And Undirected Graph 
4. Representing A Graph In Code 
5. Graph Using An Adjacency Matrix 
6. Graph Using An Adjacency List And Adjacency Set 
7. Comparison Of Graph Representations 
8. Graph Traversal - Depth First And Breadth First 
9. Graph Algorithms
10. Topological Sort In A Graph 

Implementation Of Topological Sort 

Design A Course Schedule Considering Pre-reqs For Courses

References :


https://www.programcreek.com/java-api-examples/?Query=algorithm&action=search_project&submit=Search