Answered: orithm that takes a sorted list of…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Question

Provide binary search algorithm that takes a sorted list of strings and finds a specific string x.
What is the runtime of your algorithm?

Expert Solution

Step 1

function binarySearchString(ar,i)
{
let left = 0, right = ar.length - 1;
while (left <= right) {
let mid = left + Math.floor((right - left) / 2);

let result = i.localeCompare(ar[mid]);
if (result == 0)
return mid;

if (result > 0)
left = mid + 1;

else
right = mid - 1;
}

return -1;
}

let ar=["hello", "hi", "javascript", "java"];
let i= "javascript";
let result = binarySearchString(ar, i);
if (result == -1)
console.log("Element is not present ");
else
console.log("Element is found at the "
+ "index " + result+"");

Trending now

This is a popular solution!

Step by step

Solved in 3 steps with 2 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions