- Assignment 1
- linear search
- Bubble Sort
- Binar to Decimal
- Circular Shift an array
- Merge two arrays and avoid collision
- Find majority element
- Assignment 2
- GCD
- Factorial Recursion(naive)
- Recursive Binary Search(non unique key values)
- Modify Binary Search to work on Bitonic array
- Reverse a integer (Recursive)
- Print n fibonacii numbers (Recursive)
- Assignment 3
- Insertion Sort
- Merge Sort
- Assignment 4
- Quick Sort
- Substring matching
- Structure intro program
- Assignmnt 5
- Heap Sort
- Ming Priority Queue using Heap
- Priority Queue implimentation
- Assignment 6
- Singly Linked List
- Doubly Linked List
- Singly Linked List implimentation PCB
- Assignment 7
- Stack using array
- Stack using Linked List
- Queue using array
- Queue using Linked List
- Palindrome Checking using Stack
- Queue implimentation Printer
- Assignemnt 8
- Infix To Postfix
- Evaluate Postfix and give result
- Create Expression tree form postfix
- Evaluate postfix with file handling
- Assignment 9
- BST
- BST implimentation
- Bonus
- Accepting values without total number of values
This repository has been archived by the owner on Sep 24, 2024. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 0
naveensd101/S3-Program-Design-CS2092D
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
About
No description, website, or topics provided.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published