In what situation could you not use a binary search

Solutions

Expert Solution

We cannot use a binary search on an unsorted array or unsorted element.
Binary search is an algorithm where it divides the list in half and looks for the list in the first half or in the second half.
So if we are performing binary search on an unsorted list or an unsorted array then it performs comparisions of the elements present in the list to sort it first, which is not very efficient as there are other better sorting algorithms present whose time complexity is better compared to that of which is taken by binary search to sort and unsorted list first.
Binary search on unsorted list would take atmost n+2 comparisions.
Sorting is typically an O(NlogN) transaction, where linear search is O(N), thus linear search algorithm would be better to use in case where there is an unsorted list as using binary search algorithm on an unsorted list wold take time complexity of O(nlogn) which is worst case time complexity of binary search which results in worst time complexity then O(n) which is the time complexity of linear search.
Another case where it is not considered to use binary search algorithm is when the element is not present in the list at all .

venereology answered 2 days ago

Next > < Previous

Related Solutions

Beginning with an empty binary search tree, what binary search tree is formed when you insert...

Beginning with an empty binary search tree, what binary search tree is formed when you insert the following values in the given order – consider there alphabetical position for comparison. a. W, T, N, J, E, B, A b. W, T, N, A, B, E, J c. A, B, W, J, N, T, E d. B, T, E, A, N, W, J Alphabetical positions: A-1, B-2, E-5, J-10, N-14,T-20,W-23

Prerequisite Knowledge Understand binary search tree structure Understand binary search tree operations Understand binary search tree...

Prerequisite Knowledge Understand binary search tree structure Understand binary search tree operations Understand binary search tree worst case and best case time. Learning Outcomes Describe AVL tree structure Trace and implement AVL tree operations Explain and prove AVL tree performance

Assume that you want to implement binary search with a linked list. What would be the...

Assume that you want to implement binary search with a linked list. What would be the performance of this algorithm? Compare and contrast this algorithm with the implementation of binary search on traditional sorted array and give a discussion. Your discussion and analysis must explain what the possibilities, issues and consequences of such design are, and then explain whether these issues would exist in the traditional array approach. Your answer can be around 1-2 paragraph of writing backed-up with algorithmic...

Binary Search Algorithm a.) Create a Java application that utilizes the "Binary Search Algorithm" presented in...

Binary Search Algorithm a.) Create a Java application that utilizes the "Binary Search Algorithm" presented in chapter 19 (NOT Java's pre-built binarySearch() method from imported Java library) to search for an integer in a random array of size 30 in the range of 0 to 1000 inclusive. You should use Java's random number generator to randomize the numbers in your array. b.) The application's main() method should display unsorted array and sorted array, prompt user for a search key, allow...

Q1 A- How linear search and binary search work? What is their time complexity? B- What...

Q1 A- How linear search and binary search work? What is their time complexity? B- What is a single linked list? What are the pros and cons of the linked list when comparing to parallel arrays? Q2 A- What is a register? How registers work together with ALU and Control Unit to execute a program? What is the fetch-execute cycle? B- What is the difference to implement a control unit using microprogrammed or hardwired approaches? What is clock cycle? What...

Some questions about Binary Tree's What a binary search tree is and what its advantages/disadvantages are?...

Some questions about Binary Tree's What a binary search tree is and what its advantages/disadvantages are? What trees and binary trees are? How data is inserted into a binary tree? What full and complete binary trees look like? How to perform pre, in, and post-order traversals of a tree?

In MobaXterm, with the use of the binary search tree. Implement four operations of insert, in-order...

In MobaXterm, with the use of the binary search tree. Implement four operations of insert, in-order traversal, preorder traversal, and find. Please separate the code in the four parts and explain in detail what is happening. Also, if you can please basic C language. If not, then I understand. Thank you for your time. The test cases are 'm', 'd', 'g', 'r', 'p', 'b', and 'x'. Output: Enter choice (lower case is also acceptable) --- (I)nsert, (F)ind, (Q)uit: i Enter...

Lab 5: Binary Search Tree Implement operations for a Binary Search Tree class starting from the...

Lab 5: Binary Search Tree Implement operations for a Binary Search Tree class starting from the template provided under the PolyLearn assignment, using the class TreeNode that is also provided. You may (should) implement helper methods that make your code easier to write, read, and understand. You will also need to write test cases of your own as you develop the methods. You may use iterative and/or recursive functions in your implementation. The following starter files are available . •...

1. What is the Big-O run-time of linear search and binary search in the best, average...

1. What is the Big-O run-time of linear search and binary search in the best, average and worst cases? Linear Search Binary Search Best: Worst: Average: 2. What is the Big-O runtime of the following linked list methods? addFirst() toString() What is the Big-O runtime of the below Stack method? isSorted(Node n) 3. What is the Big-O runtime of the below methods: Method A: Stack Copy Constructor Option 1 public Stack(Stack<T> original) { if(original == null) { return; }...

// This program demonstrates a Binary Search, which search for a value // in an array,...

// This program demonstrates a Binary Search, which search for a value // in an array, assuming that the array is sorted in descending order. // You have to modify the function binarySearch() to search for a value // in an array that is sorted in ascending order. // NOTES: // Uncomment line 34 and comment line 32. You don't have to edit anything // else in the main(), just in the binarySearch() function. // EXAMPLES (using the array sorted...

Subjects