[PR #1509] [CLOSED] Feat/Sorting a singly linked list using C language #2113

New Issue

claunia · 2026-01-29T15:28:53Z

claunia commented

2026-01-29 15:28:53 +00:00

📋 Pull Request Information

Original PR: https://github.com/TheAlgorithms/C/pull/1509
Author: @Nihhaar0002
Created: 10/23/2025
Status: ❌ Closed

Base: master ← Head: feat/sorting-linked-list

📝 Commits (3)

9ca6b1b Add doubly linked list implementation in C
6cd7e7e Circular linked list implementation in C
91806b7 Add linked list with sorting and utility functions in C

📊 Changes

3 files changed (+561 additions, -0 deletions)

View changed files

➕ data_structures/circular_linked_list.c (+222 -0)
➕ data_structures/doubly_linked_list.c (+32 -0)
➕ data_structures/sorting_linked_list.c (+307 -0)

📄 Description

This contribution adds a complete singly linked list implementation in C with useful operations:

Insert a node at the beginning, at a specific position, or at the end.
Delete a node from the beginning, from a specific position, or from the end.
Display the list, search for a value, and find maximum and minimum elements.
Sort the list in ascending order.
Reverse the list.
Count the total number of nodes.

The code is organized under the data_structures/ folder and follows a clear structure for easy understanding and reuse.
This implementation will help beginners understand linked list operations and provides a reference for common linked list algorithms in C.

_{🔄 This issue represents a GitHub Pull Request. It cannot be merged through Gitea due to API limitations.}

## 📋 Pull Request Information **Original PR:** https://github.com/TheAlgorithms/C/pull/1509 **Author:** [@Nihhaar0002](https://github.com/Nihhaar0002) **Created:** 10/23/2025 **Status:** ❌ Closed **Base:** `master` ← **Head:** `feat/sorting-linked-list` --- ### 📝 Commits (3) - [`9ca6b1b`](https://github.com/TheAlgorithms/C/commit/9ca6b1b2a958085f206bb33a4f0f02ff4a0fdafd) Add doubly linked list implementation in C - [`6cd7e7e`](https://github.com/TheAlgorithms/C/commit/6cd7e7ecfbdb2bbb24a54a0c14bc9c4bea5d8450) Circular linked list implementation in C - [`91806b7`](https://github.com/TheAlgorithms/C/commit/91806b757182a46fe711309cdfcb0698d8b65b32) Add linked list with sorting and utility functions in C ### 📊 Changes **3 files changed** (+561 additions, -0 deletions) <details> <summary>View changed files</summary> ➕ `data_structures/circular_linked_list.c` (+222 -0) ➕ `data_structures/doubly_linked_list.c` (+32 -0) ➕ `data_structures/sorting_linked_list.c` (+307 -0) </details> ### 📄 Description This contribution adds a complete singly linked list implementation in C with useful operations: Insert a node at the beginning, at a specific position, or at the end. Delete a node from the beginning, from a specific position, or from the end. Display the list, search for a value, and find maximum and minimum elements. Sort the list in ascending order. Reverse the list. Count the total number of nodes. The code is organized under the `data_structures/` folder and follows a clear structure for easy understanding and reuse. This implementation will help beginners understand linked list operations and provides a reference for common linked list algorithms in C. --- <sub>🔄 This issue represents a GitHub Pull Request. It cannot be merged through Gitea due to API limitations.</sub>

claunia added the pull-request label 2026-01-29 15:28:53 +00:00

claunia closed this issue

2026-01-29 15:28:54 +00:00

Sign in to join this conversation.

1 Participants

Notifications

Due Date

No due date set.

Dependencies

No dependencies set.

Reference: starred/C#2113