Binary Search
As a Systems Engineer at Tata Consultancy Services, I deliver exceptional software products for mobile and web platforms, using agile methodologies and robust quality maintenance. I am experienced in performance testing, automation testing, API testing, and manual testing, with various tools and technologies such as Jmeter, Azure LoadTest, Selenium, Java, OOPS, Maven, TestNG, and Postman.
I have successfully developed and executed detailed test plans, test cases, and scripts for Android and web applications, ensuring high-quality standards and user satisfaction. I have also demonstrated my proficiency in manual REST API testing with Postman, as well as in end-to-end performance and automation testing using Jmeter and selenium with Java, TestNG and Maven. Additionally, I have utilized Azure DevOps for bug tracking and issue management.
Given an array of integers nums which is sorted in ascending order, and an integer target, write a function to search target in nums. If target exists, then return its index. Otherwise, return -1.
You must write an algorithm with O(log n) runtime complexity.\
LeetCode Problem - 704: Link | Click Here
class Solution {
// Method to perform binary search in a sorted array
public int search(int[] nums, int target) {
// Initialize the search range
int low = 0;
int high = nums.length - 1;
// Binary search loop
while (low <= high) {
// Calculate the middle index of the current search range
int mid = low + (high - low) / 2;
// Check if the middle element is equal to the target
if (nums[mid] == target) {
return mid; // Return the index if target is found
} else if (nums[mid] > target) {
high = mid - 1; // Adjust the search range to the left half
} else {
low = mid + 1; // Adjust the search range to the right half
}
}
// Return -1 if the target is not found in the array
return -1;
}
}
