Create Median-of-Two-Sorted-Array.java

[Md-Azmir]

This is a fundamental problem, and the algorithm I used clearly illustrates the approach to solving this type of question.

• [x] I have read CONTRIBUTING.md.
• [x] This pull request is all my own work -- I have not plagiarized it.
• [x] All filenames are in PascalCase.
• [x] All functions and variable names follow Java naming conventions.
• [x] All new algorithms have a URL in their comments that points to Wikipedia or other similar explanations.
• [x] All new code is formatted with clang-format -i --style=file path/to/your/file.java

[codecov-commenter]

Codecov Report

All modified and coverable lines are covered by tests :white_check_mark:

Project coverage is 67.11%. Comparing base (6006025) to head (90e8d16).

Additional details and impacted files

@@             Coverage Diff              @@
##             master    #5910      +/-   ##
============================================
+ Coverage     67.10%   67.11%   +0.01%     
- Complexity     4560     4561       +1     
============================================
  Files           619      619              
  Lines         17098    17098              
  Branches       3296     3296              
============================================
+ Hits          11474    11476       +2     
+ Misses         5168     5167       -1     
+ Partials        456      455       -1     

:umbrella: View full report in Codecov by Sentry.
:loudspeaker: Have feedback on the report? Share it here.

[siriak]

It's already present here https://github.com/TheAlgorithms/Java/blob/60060250caec79ee1e5f9ffa93449cfccc520b30/src/main/java/com/thealgorithms/divideandconquer/MedianOfTwoSortedArrays.java#L3