mirror of
https://github.com/TheAlgorithms/Python.git
synced 2026-03-13 09:50:19 +08:00
Fix broken build: Remove trailing spaces (#3501)
* Fix broken build: Remove trailing spaces
* updating DIRECTORY.md
* One more trailing space
Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
This commit is contained in:
@@ -5,14 +5,14 @@ algorithm that is exponentially faster than any possible deterministic
|
||||
classical algorithm
|
||||
|
||||
Premise:
|
||||
We are given a hidden Boolean function f,
|
||||
We are given a hidden Boolean function f,
|
||||
which takes as input a string of bits, and returns either 0 or 1:
|
||||
|
||||
f({x0,x1,x2,...}) -> 0 or 1, where xn is 0 or 1
|
||||
|
||||
|
||||
The property of the given Boolean function is that it is guaranteed to
|
||||
either be balanced or constant. A constant function returns all 0's
|
||||
or all 1's for any input, while a balanced function returns 0's for
|
||||
either be balanced or constant. A constant function returns all 0's
|
||||
or all 1's for any input, while a balanced function returns 0's for
|
||||
exactly half of all inputs and 1's for the other half. Our task is to
|
||||
determine whether the given function is balanced or constant.
|
||||
|
||||
|
||||
Reference in New Issue
Block a user