diff --git a/src/com/interview/binarysearch/MedianOfTwoSortedArrayOfDifferentLength.java b/src/com/interview/binarysearch/MedianOfTwoSortedArrayOfDifferentLength.java
index bd67d6ee..04becc12 100644
--- a/src/com/interview/binarysearch/MedianOfTwoSortedArrayOfDifferentLength.java
+++ b/src/com/interview/binarysearch/MedianOfTwoSortedArrayOfDifferentLength.java
@@ -1,5 +1,5 @@
 package com.interview.binarysearch;
-
+// wrong code fails for the test case A:[2] B[1 3]
 /**
  * There are two sorted arrays nums1 and nums2 of size m and n respectively.
  * Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).