[PR #221] [CLOSED] BugFix : loop out of range cause the stack smashing #503

Open
opened 2026-01-29 15:13:19 +00:00 by claunia · 0 comments
Owner

📋 Pull Request Information

Original PR: https://github.com/TheAlgorithms/C/pull/221
Author: @54shady
Created: 2/19/2019
Status: Closed

Base: masterHead: BugFix


📝 Commits (1)

  • 5bb9374 BugFix : call srand before generate rand number

📊 Changes

1 file changed (+53 additions, -33 deletions)

View changed files

📝 sorting/shellSort.c (+53 -33)

📄 Description

Data Sorted
Shell Sort Big O Notation:
--> Best Case: O(n log(n))
--> Average Case: depends on gap sequence
--> Worst Case: O(n)

Time spent sorting: 0.000006
*** stack smashing detected ***: <unknown> terminated
Aborted

🔄 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/221 **Author:** [@54shady](https://github.com/54shady) **Created:** 2/19/2019 **Status:** ❌ Closed **Base:** `master` ← **Head:** `BugFix` --- ### 📝 Commits (1) - [`5bb9374`](https://github.com/TheAlgorithms/C/commit/5bb93740a482ec1ca82e3c6d36a4dba3f4b9f80d) BugFix : call srand before generate rand number ### 📊 Changes **1 file changed** (+53 additions, -33 deletions) <details> <summary>View changed files</summary> 📝 `sorting/shellSort.c` (+53 -33) </details> ### 📄 Description Data Sorted Shell Sort Big O Notation: --> Best Case: O(n log(n)) --> Average Case: depends on gap sequence --> Worst Case: O(n) Time spent sorting: 0.000006 *** stack smashing detected ***: <unknown> terminated Aborted --- <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:13:19 +00:00
Sign in to join this conversation.
1 Participants
Notifications
Due Date
No due date set.
Dependencies

No dependencies set.

Reference: starred/C#503