Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with binary-search
Search options not deleted
user 110958
Questions about the binary search algorithm, which can be used to find elements of an ordered list in O(log n) time.
1
vote
0
answers
33
views
Intersection of 2 arrays
Here is a question i came across :
Given two arrays, write a function to compute their intersection.Here we will allow the duplicates.
Note:
Each element in the result should appear as many …
- 159
1
vote
Dividing 2 integers with some constraints
With the help of Steven, i am posting the solution.
def divide(dd,dr):
'''
let dd and dr be the dividend and divisor
x be the current macium divisor, less that dividend
…
- 159
1
vote
3
answers
198
views
Dividing 2 integers with some constraints
This a problem i came across while practicing binary search. Here is the problem:
Given two integers dividend and divisor, divide two integers without using multiplication, division and mod operator. …
- 159