📘 Data Structures and Algorithms (DSA) – College Projects & Assignments This repository contains my college projects and assignments based on Data Structures and Algorithms (DSA) implemented in Python, Java, and other programming languages. 📌 About Covers fundamental data structures such as Arrays, Linked Lists, Stacks, Queues, Trees, Graphs, and Hashing. Includes algorithmic implementations like Sorting, Searching, Recursion, Greedy Algorithms, and Dynamic Programming. Each program is written with clear explanations, comments, and modular code design. Assignments and mini-projects are included to demonstrate real-world applications of DSA concepts. 🚀 Features 📂 Well-structured code for easy understanding. 📝 College assignments & practice problems. ⚡ Efficient and optimized implementations. 🎯 Suitable for students preparing for DSA exams, coding interviews, and competitive programming. 🛠️ Topics Covered ✅ Arrays and Strings ✅ Linked Lists (Singly, Doubly, Circular) ✅ Stack and Queue (including Priority Queue & Deque) ✅ Trees (Binary Tree, BST, AVL, Heap) ✅ Graphs (BFS, DFS, Shortest Path, MST) ✅ Sorting & Searching Algorithms ✅ Recursion and Backtracking ✅ Greedy & Dynamic Programming 🎓 Usage You can use this repository to: Revise college syllabus-based DSA concepts Learn through practical coding assignments Prepare for placements and coding challenges
-
Notifications
You must be signed in to change notification settings - Fork 0
Binary Search is a fast search algorithm used on sorted arrays or lists. It works by repeatedly dividing the search interval in half: Start with the whole array. Compare the middle element with the target value. If they match, return the index. If the target is greater, discard the left half. If the target is smaller, discard the right half.
SumitWagdare/data-structures-algorithm-
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Binary Search is a fast search algorithm used on sorted arrays or lists. It works by repeatedly dividing the search interval in half: Start with the whole array. Compare the middle element with the target value. If they match, return the index. If the target is greater, discard the left half. If the target is smaller, discard the right half.
Resources
Stars
Watchers
Forks
Releases
No releases published