Questions tagged [binary-search]
Binary search is an efficient algorithm for finding a key in sorted data. It runs in O(log n) time.
237
questions
1
vote
1answer
50 views
Inventory system codebase
I'm here looking for a review over my current code-base.
Please:
Ignore using namespace std; this is for educational purposes mostly so the usage of using namespace std; does not matter for this ...
3
votes
2answers
83 views
codekata: Binary search on an int array
I'm following Karate Chop kata for a binary search. I really wanted to avoid built in functionality within the language. I'm pretty new to C# so any recommendations is greatly appreciated.
Spec: ...
1
vote
0answers
37 views
Binary Search Tree to store objects now with improvements
Objective:
I'm trying to create a BST in order to insert Packet objects for search purposes. Packet holds information like partId, ...
9
votes
3answers
1k views
Binary Search in C++17
Question
Any way I can optimize this further with C++11 or C++17 features?
Would also like feedback on my variable naming, memory management, edge case handling (in this someone calling my function ...
3
votes
1answer
71 views
Project Euler Task 42 Solution
I am relatively new to programming and have been recommended to work through the many tasks in order, in order to better my skills. For some reason, problem 42 had me stumped for a while:
The nth ...
4
votes
5answers
117 views
Find the smallest element in a sorted and rotated array [closed]
I was solving a question asked in interview by Uber. It says:
Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand. Find the minimum element in \$O(\log n)\$...
4
votes
0answers
53 views
Array Search Algorithm
Recently, I've been experimenting with an array searching algorithm that I'm not sure I've seen anywhere (minor references here).
I'm still not fully-learned on how to state the efficiency of what I'...
4
votes
1answer
75 views
Building balanced BST from sorted array: recursive and iterative approaches
I am implementing an algorithm to solve the following problem:
Given a sorted (increasing order) array with unique integer elements, write an algorithm to create a binary search tree with minimal ...
4
votes
1answer
74 views
Generalisation of Binary Search
I wrote a function to implement a generalised version of binary search that can find the minimum or maximum index in a given sorted list that satisfies a provided predicate.
My Code
...
3
votes
1answer
140 views
AVL height-balanced binary search Tree and Dictionary in C# v2
Mostly as a learning exercise, and partly as I thought it might be useful, I have written an implementation of AVL trees ( https://en.wikipedia.org/wiki/AVL_tree ).
An AVL tree is a height-...
0
votes
1answer
50 views
Find array index with element equality in Python
I was given this question during an interview. It is similar to binary search and I would like to ask for feedback for my solution.
Array Index & Element Equality
Given a sorted array arr ...
0
votes
1answer
53 views
Binary search a sorted list of integers in Python 3
y is the value I am searching for. Is this the correct implementation for binary search?
...
3
votes
1answer
41 views
Extended Binary Search Function (python)
I wrote a function to find the closest value in a list to a given search value. What prompted me to write it was as boilerplate for a prime number problem so I could find the closest prime to a given ...
7
votes
3answers
582 views
Binary search for students
I'm putting together an example for students where I would like to show how we can optimize even such basic algorithm like a binary search with respect to hardware. I do not consider threads. I wrote ...
7
votes
2answers
1k views
Cleaner way to handle double pointer in C++ BST?
I have an implementation for my first binary search tree in C++. I was wondering if there was some cleaner way to avoid using the double pointer in the way I have my code setup? Such as on one line I ...
0
votes
1answer
106 views
Search insert position
I am trying to solve this problem:
Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.
and ...
3
votes
1answer
1k views
Binary search tree in C++, and display, search and delete functions
I feel ready to show you my work on creating BST in C++ using double linked list and 3 more functions for manipulating the tree. There is also one more function checking if the tree is real or not.
...
0
votes
1answer
50 views
Find the square root of the number without using any built-in function?
I am working on below problem:
Given an integer, how do you find the square root of the number
without using any built-in function?
...
2
votes
1answer
53 views
Leetcode #826. Most Profit Assigning Work solution in Java (Sort + Binary Search)
Problem Statement:
We have jobs: difficulty[i] is the difficulty of the ith job, and profit[i] is the profit of the ith job....
1
vote
1answer
159 views
Find maximum in sorted and rotated array
This is an interview question.
A sorted rotated array is a sorted array which was rotated 0 or more times.
For example: [1,2,3] -> [2,3,1]
...
0
votes
0answers
32 views
Find target in sorted array pivoted at some unknown point in O(log n)
You are given an array sorted in ascending order which is rotated at some pivot unknown to you beforehand. Find your target in O(log n) which means it should be a binary search. If the value does not ...
2
votes
0answers
234 views
AVL Tree with delete method in Python 3
Just a general code review. I'm looking for my first developer job so anything constructive is awesome. Please, and thank you very much.
I've written this implementation as an exercise and to add to ...
2
votes
1answer
77 views
Binary search tree with common operations
I trying to see if I implemented these operations correctly and if they could be optimized in any way. The implementations are just the typical implementations found online but I adjusted them to work ...
1
vote
1answer
114 views
Smallest number in BST which is greater than or equal to N
Given a Binary Search Tree and a number N, the task is to find the
smallest number in the binary search tree that is greater than or
equal to N. Print the value of the element if it exists ...
4
votes
1answer
164 views
Find largest smaller key in Binary Search Tree
Given a root of a Binary Search Tree (BST) and a number num, implement
an efficient function findLargestSmallerKey that finds the largest key
in the tree that is smaller than num. If such a number ...
0
votes
1answer
92 views
1
vote
1answer
145 views
Determining a salary for buying a house in 36 months
I did this programming challenge. Part C of the challenge, is to find the salary you have to save every month to be able to buy a house in 36 months.
This is my first time using bisection search so I ...
1
vote
2answers
74 views
BST implementation for insert (put) and contain (search) in Python
I was asked about this question by my friend, so I decided to implement it recursively. I would like to get some code review.
...
3
votes
2answers
95 views
First Swing at an AVL Tree Implementation in C++
I've implemented a simple AVL binary search tree. For no real reason I decided to implement this without multiplicity, so if we try to insert(5) twice, it's only stored once in the tree. I've also ...
1
vote
2answers
51 views
Exercise 6.1 from ANSI C book - getword function
I have a following exercise from ANSI C book:
Exercise 6.1. Our version of getword does not properly handle
underscores, string constants, comments, or preprocessor control
lines. Write a ...
1
vote
1answer
141 views
Binary search in Scala
Another exercise in Scala in which the goal is to find the target position as fast as possible. The initial input provides the grid size and the initial position. Each turn, this code provide a new ...
4
votes
1answer
214 views
Inefficient binary search? Hackerrank - Climbing the Leaderboard
I'm learning Golang and have been trying to get 100% on the following Hackerrank practice challenge: Climbing the Leaderboard
The code passes ~8 of 11 tests. The Hackerrank tests are time-bound and ...
5
votes
1answer
72 views
Binary searching the turning point of a function
The problem
You are given a list of \$ n \$ positive integers. Your task is to split the list into \$ k \$ subarrays so that the largest subarray sum is minimized.
The input
On the first line you ...
3
votes
1answer
198 views
Autocomplete implementation in Python
I have an autocomplete implementation in Python, and it passed all of the unit tests that I have included at the bottom.
...
4
votes
2answers
72 views
Binary search on a uniformly distributed vector
I am trying to write a binary search using recursion in C on a sorted vector that we can assume comes from a uniform distribution between the start and end values. What I am trying to write is an ...
0
votes
2answers
160 views
Binary search for integers
I've written binary search with only my own efforts 💪💪 without glancing at anywhere. I stuck on finding base case. At final, I think that if last checking is less than first index or first checking ...
0
votes
1answer
2k views
Perform BFS on a Binary Tree
Task: Perform Breadth first traversal on a Binary Search Tree and print the elements traversed.
...
6
votes
1answer
149 views
Searching the Array Index & Element Equality
I was asked this question from online coding interview and I have provided my solution that passes all of the test cases. I wanted to see if someone can review my code.
Array Index & Element ...
3
votes
1answer
250 views
Python Binary Search Performance
This is my version of the binary search method. What more can I do to optimize this?
I have written comments throughout to guide anyone who might find this code helpful through how it operates. But I ...
4
votes
1answer
202 views
Binary search on a Bitonic array
So, I have been preparing for an interview and I thought of coding up a Binary search on a Bitonic array for practice. A bitonic array has a bunch of numbers in increasing order at the beginning of ...
2
votes
0answers
439 views
Three sum using binary search
Given an array and a value, find all the triplets in the array whose sum is equal to the given value. For example, if the given array is {12, 3, 4, 1, 6, 9} and the ...
5
votes
1answer
189 views
0
votes
2answers
100 views
Simple binary search
Here the task (in Indonesian).
I think my binary search algorithm is correct.
Ideone
...
10
votes
1answer
162 views
Using bisect to flip coins
I am trying to solve this problem on Codechef, which has a list of \$N\$ coins, all initially tails-up, and a list of \$Q\$ commands. There are two possible commands, ...
4
votes
3answers
774 views
Counting the number of 1 bits in a sorted bit array
I wrote a function in python to count the number of 1-bits in a sorted bit array. I'm basically using binary search but the code seems unnecessarily long and awkward. I did test it for several ...
3
votes
1answer
115 views
Binary search for IOI problem: Cave
Question
http://www.ioinformatics.org/locations/ioi13/contest/day2/cave/cave.pdf
Code
...
5
votes
1answer
114 views
iterative binary_search Python implementation
I did a Python implementation of binary search implementation
iteratively. It passes all of the test and I was wondering if I can
get any feedback.
...
1
vote
2answers
310 views
binary search using recursion [closed]
I implemented a binary search algorithm using recursion in Java
package com.soloworld.binarysearch;
...
1
vote
1answer
55 views
Getting partition boundaries in sorted integer array using only equalTo operator
For my task, I need to find partition boundaries in sorted input. Values are expected to be repeated, I just need to find range for each value. Please check comment in following output for example.
...
1
vote
1answer
81 views
Binary search large tree in C
I tested creating 1 billion (1,000,000,000) nodes and lookups are fast. You can ask for a node by node_id.
...
