Skip to content

Conversation

@anshmittal2004
Copy link

Closes #13717

Description

Added O(log(min(m,n))) implementation for median of two sorted arrays in divide_and_conquer/.

  • Uses binary search on partitions.
  • Includes docstring with examples and complexity.
  • Handles edge cases (empty arrays, odd/even lengths).
  • Added basic test cases.
  • Added explanation in Algorithms-Explanation/divide_and_conquer/median_of_two_sorted_arrays.md.

[Hacktoberfest 2025 contribution]

Checklist

  • I have read the contribution guidelines.
  • The submitted code is in compliance with The Algorithms "Code quality" guidelines.
  • I have added a description to my changes.
  • I have added tests for the implementation.
  • I have added an explanation to my implementation.
  • The code is not plagiarized and my own implementation.
  • The code is submitted to the correct issue.
  • I have run black to format the code.
  • I have run mypy to check for type hints.
  • I have read the README and the DIRECTORY and the submitted code is not duplicated.

@algorithms-keeper algorithms-keeper bot added the require tests Tests [doctest/unittest/pytest] are required label Oct 24, 2025
Copy link

@algorithms-keeper algorithms-keeper bot left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Click here to look at the relevant links ⬇️

🔗 Relevant Links

Repository:

Python:

Automated review generated by algorithms-keeper. If there's any problem regarding this review, please open an issue about it.

algorithms-keeper commands and options

algorithms-keeper actions can be triggered by commenting on this PR:

  • @algorithms-keeper review to trigger the checks for only added pull request files
  • @algorithms-keeper review-all to trigger the checks for all the pull request files, including the modified files. As we cannot post review comments on lines not part of the diff, this command will post all the messages in one comment.

NOTE: Commands are in beta and so this feature is restricted only to a member or owner of the organization.

from typing import List


def find_median_sorted_arrays(nums1: List[int], nums2: List[int]) -> float:

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

As there is no test file in this pull request nor any test function or class in the file divide_and_conquer/median_of_two_sorted_arrays.py, please provide doctest for the function find_median_sorted_arrays

@algorithms-keeper algorithms-keeper bot added the awaiting reviews This PR is ready to be reviewed label Oct 24, 2025
@algorithms-keeper algorithms-keeper bot added the tests are failing Do not merge until tests pass label Oct 24, 2025
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

awaiting reviews This PR is ready to be reviewed require tests Tests [doctest/unittest/pytest] are required tests are failing Do not merge until tests pass

Projects

None yet

Development

Successfully merging this pull request may close these issues.

Median of Two sorted arrays

1 participant