[PR #1031] [CLOSED] Update to binary_insertion_sort.c #1579

Closed
opened 2026-01-29 15:22:28 +00:00 by claunia · 0 comments
Owner

📋 Pull Request Information

Original PR: https://github.com/TheAlgorithms/C/pull/1031
Author: @sarthaktanwani
Created: 10/10/2022
Status: Closed

Base: masterHead: master


📝 Commits (3)

  • ee7daab Update to binary_insertion_sort.c
  • 2a39397 testing first commit
  • a97cd20 Safely allocation a fixed max size of array as opposed to directly taking size as input which may be unsafe

📊 Changes

1 file changed (+6 additions, -1 deletions)

View changed files

📝 sorting/binary_insertion_sort.c (+6 -1)

📄 Description

Pre-increment is supposed to be more efficient

Description of Change

References

Checklist

  • Added description of change
  • Added file name matches File name guidelines
  • Added tests and example, test must pass
  • Relevant documentation/comments is changed or added
  • PR title follows semantic commit guidelines
  • Search previous suggestions before making a new one, as yours may be a duplicate.
  • I acknowledge that all my contributions will be made under the project's license.

Notes:


🔄 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/1031 **Author:** [@sarthaktanwani](https://github.com/sarthaktanwani) **Created:** 10/10/2022 **Status:** ❌ Closed **Base:** `master` ← **Head:** `master` --- ### 📝 Commits (3) - [`ee7daab`](https://github.com/TheAlgorithms/C/commit/ee7daabfca5d60c484ec4dc9e06669921bed305e) Update to binary_insertion_sort.c - [`2a39397`](https://github.com/TheAlgorithms/C/commit/2a3939727d4c424b7d1fcee1e0de7ee3dfb4349d) testing first commit - [`a97cd20`](https://github.com/TheAlgorithms/C/commit/a97cd20a8240eaf8bbb84dfc6416f95367377871) Safely allocation a fixed max size of array as opposed to directly taking size as input which may be unsafe ### 📊 Changes **1 file changed** (+6 additions, -1 deletions) <details> <summary>View changed files</summary> 📝 `sorting/binary_insertion_sort.c` (+6 -1) </details> ### 📄 Description Pre-increment is supposed to be more efficient #### Description of Change <!-- Thank you for your Pull Request. Please provide a description above and review the requirements below. Contributors guide: https://github.com/TheAlgorithms/C/blob/master/CONTRIBUTING.md --> #### References <!-- Add any reference to previous pull-request or issue --> #### Checklist <!-- Remove items that do not apply. For completed items, change [ ] to [x]. --> - [x] Added description of change - [ ] Added file name matches [File name guidelines](https://github.com/TheAlgorithms/C/blob/master/CONTRIBUTING.md#File-Name-guidelines) - [ ] Added tests and example, test must pass - [ ] Relevant documentation/comments is changed or added - [ ] PR title follows semantic [commit guidelines](https://github.com/TheAlgorithms/C/blob/master/CONTRIBUTING.md#Commit-Guidelines) - [ ] Search previous suggestions before making a new one, as yours may be a duplicate. - [ ] I acknowledge that all my contributions will be made under the project's license. Notes: <!-- Please add a one-line description for developers or pull request viewers --> --- <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:22:28 +00:00
Sign in to join this conversation.
1 Participants
Notifications
Due Date
No due date set.
Dependencies

No dependencies set.

Reference: starred/C#1579