binary search in 2d array better implement

Fr4nc3 · Fr4nc3 · commit 48dadec756fd · 2018-06-18T17:51:58.000-04:00
diff --git a/consoleApp/consoleApp/MySort.cs b/consoleApp/consoleApp/MySort.cs
@@ -53,23 +53,28 @@ static public List<int> binarySearch(int[][] matrix, int v){
 
 
                     }
-                    else
+                    else if(matrix[i][mid] > v)
                     { 
-                        r = mid;
+                        r = mid-1;
 
                     }
+                    else if(matrix[i][mid] == v)
+                    {
+                        result.Add(i);
+                        result.Add(l);
+                        return result;
+                    }
 
 
                 }
-                if(matrix[i][l]== v){
-                    result.Add(i);
-                    result.Add(l);
-                    return result;
-                }
+
             }
             return result;
 
 
+
+  
+
         }
         static public List<int> FindValue(int[][] matrix, int v)
         {

Original file line number	Diff line number	Diff line change
`@@ -53,23 +53,28 @@ static public List<int> binarySearch(int[][] matrix, int v){`
`53`	`53`
`54`	`54`
`55`	`55`	`}`
`56`		`- else`
	`56`	`+ else if(matrix[i][mid] > v)`
`57`	`57`	`{`
`58`		`- r = mid;`
	`58`	`+ r = mid-1;`
`59`	`59`
`60`	`60`	`}`
	`61`	`+ else if(matrix[i][mid] == v)`
	`62`	`+ {`
	`63`	`+ result.Add(i);`
	`64`	`+ result.Add(l);`
	`65`	`+ return result;`
	`66`	`+ }`
`61`	`67`
`62`	`68`
`63`	`69`	`}`
`64`		`- if(matrix[i][l]== v){`
`65`		`- result.Add(i);`
`66`		`- result.Add(l);`
`67`		`- return result;`
`68`		`- }`
	`70`	`+`
`69`	`71`	`}`
`70`	`72`	`return result;`
`71`	`73`
`72`	`74`
	`75`	`+`
	`76`	`+`
	`77`	`+`
`73`	`78`	`}`
`74`	`79`	`static public List<int> FindValue(int[][] matrix, int v)`
`75`	`80`	`{`