Skip to content
/ Foundational-Data-Structures-and-Sorting-Algorithms-in-C Public

This repository provides a collection of foundational data structures and sorting algorithms in C, including stacks, queues, linked lists, Bubble Sort, Merge Sort, Linear Search, and Binary Search. It offers practical implementations and performance comparisons to help learners grasp core concepts.

1 star 0 forks Branches Tags Activity
Star
Notifications You must be signed in to change notification settings

iamshibly/Foundational-Data-Structures-and-Sorting-Algorithms-in-C

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

7 Commits
1. Basic stack push po empty top.c
1. Basic stack push po empty top.c
 
 
10. Traverse in void function-Single Linked List (Inserting a Node at the End).c
10. Traverse in void function-Single Linked List (Inserting a Node at the End).c
 
 
11. Without traverse in call func-Single Linked List (Inserting a Node at the End).c
11. Without traverse in call func-Single Linked List (Inserting a Node at the End).c
 
 
12. Inserting the Data at the Beginning of Single Linked List.c
12. Inserting the Data at the Beginning of Single Linked List.c
 
 
13. Single Linked List (Inserting a Node at a Certain Position).c
13. Single Linked List (Inserting a Node at a Certain Position).c
 
 
14. Single Linked List (Deleting the First Node).c
14. Single Linked List (Deleting the First Node).c
 
 
15. Single Linked List (Deleting the Last Node using Single Pointer).c
15. Single Linked List (Deleting the Last Node using Single Pointer).c
 
 
16. Single Linked List (Deleting the Node at a Particular Position).c
16. Single Linked List (Deleting the Node at a Particular Position).c
 
 
17. Deleting the Entire Single Linked List.c
17. Deleting the Entire Single Linked List.c
 
 
18. Reverse a Single Linked List.c
18. Reverse a Single Linked List.c
 
 
19. Bubble sort.c
19. Bubble sort.c
 
 
2. stacks extra KNowledge of push pop empty ful top peek.c
2. stacks extra KNowledge of push pop empty ful top peek.c
 
 
20. Merge Sort.c
20. Merge Sort.c
 
 
21. Time diffference of merge and buuble.c
21. Time diffference of merge and buuble.c
 
 
22. linear search basic.c
22. linear search basic.c
 
 
23. Binary search basic.c
23. Binary search basic.c
 
 
24. Binary and linear search.c
24. Binary and linear search.c
 
 
25. Using two queue for haivg sorted_queue like priority queue.c
25. Using two queue for haivg sorted_queue like priority queue.c
 
 
26. Merge Sort with Lower and Upper Bound Search.c
26. Merge Sort with Lower and Upper Bound Search.c
 
 
3. stacks to find and display the prime factor of a number in descending order.c
3. stacks to find and display the prime factor of a number in descending order.c
 
 
4. decimal to binary conversion with stacks.c
4. decimal to binary conversion with stacks.c
 
 
5. Full details Basic of Queue.c
5. Full details Basic of Queue.c
 
 
6. Basic in my way for Queue.c
6. Basic in my way for Queue.c
 
 
7. Basic Single Linked List and create the first node of the list.c
7. Basic Single Linked List and create the first node of the list.c
 
 
8. Linked two node.c
8. Linked two node.c
 
 
9. Complete single linked list and do travse_ count total node _print data .c
9. Complete single linked list and do travse_ count total node _print data .c
 
 
README.md
README.md
 
 

Repository files navigation

Foundational Data Structures and Sorting Algorithms: A Complete Collection

This repository provides a comprehensive collection of foundational data structures and sorting algorithms implemented in C. It covers various key topics, from basic operations in stacks, queues, and linked lists to sorting algorithms like Bubble Sort and Merge Sort. Each program demonstrates practical implementations, along with additional topics like search algorithms and algorithm performance analysis.

Topics Covered

  • Stacks: Basic operations, including push, pop, peek, and additional applications such as prime factorization and decimal to binary conversion.
  • Queues: Basic queue operations and advanced concepts like using two queues to simulate a priority queue.
  • Linked Lists: Detailed implementations of single linked lists with functions to insert, delete, reverse, and traverse nodes.
  • Sorting Algorithms: Common sorting techniques such as Bubble Sort and Merge Sort, along with performance comparisons.
  • Search Algorithms: Implementations of Linear Search and Binary Search algorithms.
  • Miscellaneous: Various algorithmic exercises, including a time difference analysis between Merge Sort and Bubble Sort.

About

This repository provides a collection of foundational data structures and sorting algorithms in C, including stacks, queues, linked lists, Bubble Sort, Merge Sort, Linear Search, and Binary Search. It offers practical implementations and performance comparisons to help learners grasp core concepts.

Topics

stack mergesort sorting-algorithms binary-search linear-search bubblesort linear-queue single-linked-list-oprations

Resources

Readme
Activity

Stars

1 star

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages