Data Structures and Algorithms C# code in GitHub – Learn To Code
Search, Sort, Binary Heaps, Binary Trees, Nary Trees (paired with C# implementations in an open-source GitHub repo)
What you’ll learn
Data Structures and Algorithms C# code in GitHub – Learn To Code
- Sort algorithms (bubble, insertion, selection, quick, merge, heap, radix), Search algorithms (linear, hash-table, binary, ternary, jump, exponential, Fibonacci), Binary Search Trees, AVL trees, Red-Black trees, B-Trees, B+Trees, Min Binary Heap, Max Binary Heap, Min-Max Binary Heap
Description
This course teaches a comprehensive list of basic and advanced data structures and algorithms, an essential topic of coding interviews at tech companies.
The course is paired with a C# GitHub open source project (username: PiJei, repository name: AlgorithmsAndDataStructures) where each algorithm is tagged with its space and time complexities (Big O) and tested for correctness with the exact same examples used in this course.
If you are a developer or a graduate student who is preparing for coding interviews at large tech firms as Google, Amazon, Facebook, Apple, Microsoft, or smaller high tech companies, you have landed in the right place.
Search Algorithms:
- Linear Search
- Hash-Table Search
- Jump Search
- Exponential Search
- Fibonacci Search
- Binary Search
- Ternary Search
- Interpolation Search
Sort Algorithms:
- Bubble Sort
- Insertion Sort
- Selection Sort
- Quick Sort
- Merge Sort
- Radix Sort
- Heap Sort
Binary Heaps:
- Min Binary Heap
- Max Binary Heap
- Min-Max Binary HeapWith these operations:
- Build
- Insert
- Delete
Binary Trees:
- Binary Search Tree
- AVL Tree
- RedBlack TreeWith these operations:
- Insert
- Delete
Nary Trees:
- B Tree
- B+ TreeWith these operations:a. Insertb. Delete
Who this course is for:
- Anyone preparing for coding interviews at GAFAM, or high tech firms
- Students of computer science/engineering
- Learn PHP and MYSQL
Add Comment