Binary search is an efficient algorithm for finding a key in sorted data. It runs in O(log n) time.
1
vote
0answers
12 views
Basic Binary Tree in Go
As an exercise I have written a basic binary tree implementation in Go.
Tree struct:
...
1
vote
0answers
34 views
Simple peak finder solution - O(log n)
I attempted a solution to a seemingly simple problem:
Peak Finder
Let input be a list. input[i] is a peak if ...
9
votes
2answers
74 views
Karate Chop Kata
I had some time to kill today, and I found the Karate Chop Kata.
Specification:
Write a binary chop method that takes an integer search target and a sorted array of integers. It should ...
1
vote
1answer
52 views
Binary search using recursion, iteration, shifted array
Interview question some engineer, asked me to write binary search in 2 ways,
Also asked me to write binary search on a shifted array (10 20 1 2 3 4).
Wrote that and then asked me to find the offset ...
1
vote
1answer
34 views
insertBST exercise
I'm just learning Haskell on my own, and did an exercise to implement insertBST.
Is this idiomatic Haskell?
...
6
votes
1answer
153 views
Excel VBA binary search class module [closed]
I have a long list of sorted strings in a Workbook, and I have to find a lot of values in it. I was hoping to build a binary search Class Module that will find them for me faster than Excel's built-in ...
2
votes
1answer
54 views
Binary Search in C
The standard C library function bsearch wasn't giving me correct results, apparently. So I decided to implement a binary searching function in place of it. It ...
2
votes
0answers
131 views
Binary Search Tree in Ruby
Binary Search Tree, with preorder traverse. What other methods should I add? How can I improve it?
...
2
votes
0answers
29 views
Mini Binary Tree “library”
This is my first attempt at learning binary trees. I'm looking for general feedback on how it could be made cleaner, more idiomatic, or more efficient.
...
3
votes
2answers
338 views
Read binary file by blocks
I wrote a function that allow me to read a binary file using 3 blocks what ever the length of file.
I've decided to divide the length of my file into 3:
block 1: ______________
block 2: ...
2
votes
0answers
23 views
BST remove implementation
As practise, I implemented a BST and also the remove() method, but I figured I always have to check if the node being deleted is coming from the left child or the ...
3
votes
3answers
551 views
Binary search tree with tree traversal
Although there are several implementations of binary search tree, I have made my own implementation for practice. The following code does the followoing operation
- Create a binary tree
- search ...
5
votes
2answers
91 views
UniqueList Class in VBA
I often find myself abusing dictionary objects just for the exist method like this,
...
1
vote
2answers
156 views
Binary search as a generic algorithm
I am upgrading my C++11 knowledge and repeating some essential algorithm. Here is binary search only in terms of iterators.
...
5
votes
2answers
193 views
Binary search: first/last/random occurrence
I've written some code to "binary search" a list, and return the first occurrence of the target:
...
7
votes
1answer
213 views
1
vote
2answers
60 views
Binary Insert Method - handling edge cases
I've created a function that uses binary search to insert an element into an array (similar to this question). I haven't benchmarked it, but based on my knowledge it should get \$O(1)\$ in the best ...
1
vote
1answer
94 views
0
votes
2answers
349 views
How to search for a word in a sorted text file efficiently?
I want to write my own program to search for a word in a sorted text file. In the text file each word is in one line. I want to write this myself because I did not find any simple program (without ...
10
votes
7answers
3k views
Find the duplicate in a sorted array In less-than O(n)
Assumptions:
The array is sorted.
There is only one duplicate.
The array is only populated with numbers [0, n], where n is the length of the array.
Example array: [0,1,2,3,4,5,6,7,8,8,9]
...
3
votes
2answers
232 views
BinarySearch Tree implementation & traversals
I am practicing various tree algorithms and that require code review for it's efficiency, clarity and also if it can be made better etc.
Is there a better way to call ...
12
votes
6answers
2k views
Binary search use in simple guessing game
I'm making a simple guessing game in C. Basically what I need is some help double-checking my work, more specifically a verification that the my binary search in my case statements look okay. The goal ...
1
vote
0answers
31 views
Binary search with heurisitcs or something else
Currently I'm using a binary search algorithm to search an index of a tree that represents an XML file.
Can I use heuristics to improve the search? What can I do to improve this search function?
...
5
votes
1answer
406 views
Searching in a sorted 2D matrix
If I was at an interview, and wrote this code, what would you think? Please be brutal.
Time it took to wrote it: 13 minutes
Problem:
Write an efficient algorithm that searches for a value in an ...
5
votes
1answer
186 views
BinarySearch Kata in Ruby
I've just completed this binary search kata - which has some weird requirements - and I spent a little while "cleaning" up my code and making it more compact. I would appreciate some feedback on the ...
7
votes
2answers
439 views
Can this recursive binary search in C be made more concise?
Can someone please let me know if they see glaring issues with this code? I tested a handful of cases and it seems to work but in other threads. I often see much more concisely written versions of ...
5
votes
3answers
6k views
1
vote
1answer
142 views
Find last zero in infinite stream of 0's followed by 1's
Given an infinite stream with the property, such that after all 0's there are only all 1's, find the index of the last 0.
I'm looking for code review, best practices, optimizations etc. Verifying ...
1
vote
1answer
899 views
Search an element/item in an n-ary tree
Search an element in a n-ary tree. Looking for good code practices, optimizations etc.
If question is ambiguous, let me know and I will reply ASAP.
Note - ...
3
votes
4answers
1k views
Median of two sorted equal sized arrays on combination
The comprehensive description of the problem can be found here. I'm looking for code review, clever optimizations, adherence to best practices. etc.
This code is also a correction of code previously ...
3
votes
1answer
77 views
Is this binary search in TypeScript correct?
I need your help to see if the following binary search code is correct. I did my best to cover the corner cases. I wonder if I missed anything.
The code as it is with tests (you can play with it ...
4
votes
2answers
151 views
Testing to see if tree is BST
I found a function online that tests if a tree is a binary search tree:
...
7
votes
3answers
172 views
Finding an element in a list
I'm kind of new to Python. So, I wonder which method is better to use in a function to find an element in a list.
First:
...
2
votes
2answers
280 views
Binary search in rotated sorted array
Looking for code review, optimizations, good practice recommendations etc.
...
5
votes
2answers
3k views
Binary search for inserting in array
I have written a method that uses binary search to insert a value into an array.
It is working, but i would like to get a second opinion to see if i didn't write too much code for it. aka doing same ...
3
votes
5answers
497 views
count all array[index] == index occurrences
The method foo gets a sorted list with different numbers as a parameter and returns the count of all the occurrences such that: ...
5
votes
2answers
895 views
Finding greatest value in array smaller than x
Code review requested to make this code simpler, cleaner, and better. Input array is sorted.
This program finds the greatest number smaller than x. So, in an ...
6
votes
1answer
280 views
Is this implementation of binary search correct?
Is this implementation of binary search correct? Any special or edge cases that I missed out? Maybe it should be optimized for elements that are less than the first element of the array or greater ...
1
vote
2answers
230 views
Binary search on cstrings
This implements binary search on an array of cstrings. One thing I'm wondering about is it faster or slower to pass a variable as const i.e. len. Also ...
2
votes
2answers
667 views
5
votes
1answer
226 views
Duplicate detection and reporting in a BST
For the purpose of this problem, the BST is defined to allow duplicates, and the duplicate values will always follow to the right-side of the parent nodes with the same value. For example, with the ...
3
votes
1answer
403 views
Binary Search Tree insert method (map interface)
This is my implementation based on Map<K,V> interface. The BST is a linked binary tree with root reference, both internal and external nodes (...
2
votes
1answer
458 views
Custom linked list class
I put together a Custom Linked List class in hopes of using it for a Talent/Skill Tree for a game. It allows for inserting nodes with NSMutableDictionary for ...
2
votes
1answer
227 views
First Occurrence of Number in Binary Search?
I am trying to write a function, where given a sorted array, and a number, it returns the FIRST index of that number.
Is this correct? Code is in Ruby, but even if you don't know Ruby, you can pretty ...
1
vote
2answers
156 views
Fast integer handling
Each data structure has it's own time complexities. The biggest one that jumps out at you is the hash table. The average times for Insertion, Deletion and Searching are all O(1). But it's really ...
1
vote
1answer
79 views
Binary Search Feedback
I have written a binary search algorithm, but it seems to be a bit different than other peoples that I've seen. I was hoping that the community could give me some feedback as to whether or not I'm ...
4
votes
4answers
2k views
Check if a Binary Tree <String> is aBinary Search Tree
I'm understanding the question, but I want to know whether or not my implementation is correct.
The question is:
Write a method that accepts as its argument a BinaryTree object and
returns true ...
2
votes
1answer
317 views
Finding the max subset of non-overlapping intervals
How could this code become cleaner? I think that the way I handle the interfaces and binary search could be improved. I am trying to understand how to structure such a code (and usage of APIs) in a ...
3
votes
1answer
587 views
Returning Binary Search Tree Nodes in Zig Zag manner
I tried to implement an answer for the algorithm question given below. I implemented two different solutions. I couldn't decide which one is better. ( Maybe none )
Note: Node class and ZigZag ...
2
votes
0answers
244 views
Binary search algorithm for non-overlapping time spans and possible gaps
I have a data structure, containing time span nodes, with the following properties:
Nodes are sorted ascending
Time spans will not overlap, but may have gaps between them
Each node will have a start ...
