[PR #1391] [CLOSED] Implement rotated_search and iterative exponential binary search functions #1988

New Issue

claunia · 2026-01-29T15:27:10Z

claunia commented

2026-01-29 15:27:10 +00:00

📋 Pull Request Information

Original PR: https://github.com/TheAlgorithms/C/pull/1391
Author: @GziXnine
Created: 5/7/2024
Status: ❌ Closed

Base: master ← Head: GziXnine

📝 Commits (2)

8c5feb0 feat: Implement iterative exponential binary search following C standard
a71ad81 feat: Implement rotated_search function

📊 Changes

2 files changed (+253 additions, -0 deletions)

View changed files

➕ searching/exponential_search2.c (+136 -0)
➕ searching/rotated_search.c (+117 -0)

📄 Description

This pull request adds two new features to the project:

1 - Implement rotated_search function:
Introduces a new function rotated_search in rotated_search.c for efficiently searching in rotated sorted arrays.
The function is implemented following the algorithm described in the GeeksforGeeks article linked in the file header.
Self-test cases are included to validate the correctness of the implementation.
2 - Implement iterative exponential binary search following C standard:
Adds an implementation of iterative exponential binary search in a separate commit.
The implementation adheres to the C standard and provides efficient searching capabilities.
Each commit is structured following the commit guidelines provided.

_{🔄 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/1391 **Author:** [@GziXnine](https://github.com/GziXnine) **Created:** 5/7/2024 **Status:** ❌ Closed **Base:** `master` ← **Head:** `GziXnine` --- ### 📝 Commits (2) - [`8c5feb0`](https://github.com/TheAlgorithms/C/commit/8c5feb043462c54f7c5a72dca385b32b16b36ed2) feat: Implement iterative exponential binary search following C standard - [`a71ad81`](https://github.com/TheAlgorithms/C/commit/a71ad81c3e974bcecf71a2f4aef9add18cad0251) feat: Implement rotated_search function ### 📊 Changes **2 files changed** (+253 additions, -0 deletions) <details> <summary>View changed files</summary> ➕ `searching/exponential_search2.c` (+136 -0) ➕ `searching/rotated_search.c` (+117 -0) </details> ### 📄 Description This pull request adds two new features to the project: 1 - Implement rotated_search function: Introduces a new function rotated_search in rotated_search.c for efficiently searching in rotated sorted arrays. The function is implemented following the algorithm described in the GeeksforGeeks article linked in the file header. Self-test cases are included to validate the correctness of the implementation. 2 - Implement iterative exponential binary search following C standard: Adds an implementation of iterative exponential binary search in a separate commit. The implementation adheres to the C standard and provides efficient searching capabilities. Each commit is structured following the commit guidelines provided. --- <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:27:10 +00:00

Sign in to join this conversation.

1 Participants

Notifications

Due Date

No due date set.

Dependencies

No dependencies set.

Reference: starred/C#1988