Added Code For Median of Two Sorted Arrays (#61)

* Added code for median of two sorted arrays

* Error fixed

* Error fixed

Author: Revenge-Rakesh

Diff for: Java/median-of-two-sorted-arrays.java

@@ -0,0 +1,44 @@
+class Solution {
+    public double findMedianSortedArrays(int[] nums1, int[] nums2) {
+        
+        //Easy for Binary search on smaller length array
+        //Checking the length and calling the main Function with smaller len array as forst array
+        if(nums1.length > nums2.length){
+           return findMedianSortedArrays(nums2,nums1);
+        }
+        
+        int len1 = nums1.length;
+        int len2 = nums2.length;
+         //System.out.println(len1 + " " + len2);
+    
+        //Doing Binary search on smaller array
+        int start = 0;
+        int end = len1;
+        while(start<=end){
+          int partion1 = (start+end)/2;
+          int partion2 = ((len1+len2+1)/2 - partion1);
+            
+            //finding the max and min lenemt is num1 array
+            int max1 = (partion1 == 0 ) ? Integer.MIN_VALUE : nums1[partion1-1];
+            int min1 = (partion1 == len1) ? Integer.MAX_VALUE : nums1[partion1];
+            
+            //finding the max and min elemnt of nums2 array
+            int max2 = (partion2 == 0 ) ? Integer.MIN_VALUE : nums2[partion2-1];
+            //System.out.println(Integer.MIN_VALUE + " "  + Integer.MAX_VALUE);
+            int min2 = (partion2 == len2) ? Integer.MAX_VALUE : nums2[partion2];
+            
+            if(max1 <= min2 && max2 <= min1){ 
+                if((len1 + len2 ) %2 == 0){
+                    return (double)(Math.max(max1, max2) + Math.min(min1, min2))/2;
+                }else{
+                    return (double)Math.max(max1,max2);
+                }
+            }else if( max1 > min2){
+              end = partion1 - 1;
+            }else{
+                start = partion1 + 1;
+            }
+       }
+        return 0;
+    }
+}

Diff for: README.md

@@ -216,7 +216,7 @@ Check out ---> [Sample PR](https://github.com/codedecks-in/LeetCode-Solutions/pu
 | #   | Title                                                                                         | Solution                                            | Time     | Space  | Difficulty | Tag | Note             |
 | --- | --------------------------------------------------------------------------------------------- | --------------------------------------------------- | -------- | ------ | ---------- | --- | ---------------- |
 | 005 | [Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring/) | [Python](./Python/5_LongestPalindromicSubstring.py) | _O(N^2)_ | _O(N)_ | Medium     |     | Expand the Wings |
-
+| 4   | [Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays/)     | [Java](./Java/median-of-two-sorted-arrays.java)    | _O(log(min(m,n)))_ | _O(1)_ | Hard |  |  |
 <br/>
 <div align="right">
     <b><a href="#algorithms">⬆️ Back to Top</a></b>
@@ -371,7 +371,7 @@ DISCLAIMER: This above mentioned resources have affiliate links, which means if
 | [Fenil Dobariya](https://github.com/ifenil)  <br>  <img src="https://rb.gy/iascx3" width="100" height="100">                                     | India   | Java                 | [Github](https://github.com/ifenil) |                                
 | [Prashansa Tanwar](https://github.com/prashansatanwar)  <br>  <img src="https://github.com/prashansatanwar.png" width="100" height="100">        | India   | C++                  | [Leetcode](https://leetcode.com/prashansaaa/) | 
 | [Ishu Raj](https://github.com/ir2010)  <br>  <img src="https://github.com/ir2010.png" width="100" height="100">   | India | C++ | [Leetcode](https://leetcode.com/ishuraj2010/) |
-
+| [Rakesh Bhadhavath](https://github.com/Revenge-Rakesh) <br> <img src="https://avatars2.githubusercontent.com/u/36032275?v=4" width="100" height="100"> | India   | Java          | [Leetcode](https://leetcode.com/goal_cracker/) |
 
 <br/>
 <div align="right">