id stringlengths 31 33 | content stringlengths 3.15k 42.5k |
|---|---|
code_ujb_defectdetection_data_501 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_502 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_503 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_504 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_505 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_506 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_507 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_508 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_509 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_510 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_511 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_512 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_513 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_514 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_515 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_516 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_517 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_518 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_519 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_520 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_521 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_522 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_523 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_524 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_525 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_526 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_527 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_528 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_529 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_530 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_531 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_532 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_533 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_534 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_535 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_536 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_537 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_538 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_539 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_540 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_541 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_542 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_543 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_544 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_545 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_546 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_547 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_548 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_549 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_550 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_551 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_552 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_553 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_554 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_555 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_556 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_557 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_558 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_559 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_560 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_561 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_562 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_563 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_564 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_565 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_566 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_567 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_568 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_569 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_570 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_571 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_572 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_573 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_574 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_575 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_576 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_577 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_578 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_579 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_580 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_581 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_582 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_583 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_584 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_585 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_586 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_587 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_588 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_589 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_590 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_591 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_592 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_593 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_594 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_595 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_596 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_597 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_598 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_599 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
code_ujb_defectdetection_data_600 | /**
* Perform a binary search on a sorted array to find the position of a specified element.
*/
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r + l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, m... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.