Add iterative implementation alongside recursive BinarySearch

[Mudita-Singh]

🧩 Description
Added an iterative implementation of Binary Search alongside the existing recursive approach.

🚀 Changes Made
Implemented findIterative method using an iterative approach
Maintains consistency with existing generic structure (T extends Comparable)
Uses bitwise shift (>>> 1) for midpoint calculation, consistent with existing implementation

✅ Benefits
Avoids recursion overhead
Uses constant space complexity O(1)
Helps beginners understand both approaches

🧪 Testing
Tested with sample inputs to ensure correctness.

[codecov-commenter]

Codecov Report

✅ All modified and coverable lines are covered by tests.
✅ Project coverage is 79.40%. Comparing base (9729e56) to head (1ffcdf7).

Additional details and impacted files

@@            Coverage Diff            @@
##             master    #7359   +/-   ##
=========================================
  Coverage     79.39%   79.40%           
- Complexity     7092     7095    +3     
=========================================
  Files           792      792           
  Lines         23226    23226           
  Branches       4568     4568           
=========================================
+ Hits          18441    18442    +1     
  Misses         4047     4047           
+ Partials        738      737    -1     

☔ View full report in Codecov by Sentry.
📢 Have feedback on the report? Share it here.

🚀 New features to boost your workflow:

• ❄️ Test Analytics: Detect flaky tests, report on failures, and find test suite problems.

[Mudita-Singh]

Added an iterative implementation of Binary Search alongside the existing recursive approach.