I guess it's a common case to search an odd number with expression num%2 != 0. Wonder what stands behind it comparing to num%2 == 1, especially in terms of its implementation in python.
Comparison in python (!= vs ==)
67 Views Asked by Sergii At
1
There are 1 best solutions below
Related Questions in PYTHON
- prolog traverse nonstandard tree left to right
- Constraint not propagated upon instantiation of list members
- SWI Prolog pass a goal with non-zero arity through the command line arguments
- Predicate that pick elements which are on list twice not less not more
- prolog-false is returned instead of a number
- Freezing goal in prolog
- freeze for more than one variable
- Why I can't get an answer for the Ship Puzzle with Prolog?
- Evaluate a number in (a few) natural language
- Prolog binding arguments
Related Questions in COMPARISON-OPERATORS
- prolog traverse nonstandard tree left to right
- Constraint not propagated upon instantiation of list members
- SWI Prolog pass a goal with non-zero arity through the command line arguments
- Predicate that pick elements which are on list twice not less not more
- prolog-false is returned instead of a number
- Freezing goal in prolog
- freeze for more than one variable
- Why I can't get an answer for the Ship Puzzle with Prolog?
- Evaluate a number in (a few) natural language
- Prolog binding arguments
Related Questions in LANGUAGE-IMPLEMENTATION
- prolog traverse nonstandard tree left to right
- Constraint not propagated upon instantiation of list members
- SWI Prolog pass a goal with non-zero arity through the command line arguments
- Predicate that pick elements which are on list twice not less not more
- prolog-false is returned instead of a number
- Freezing goal in prolog
- freeze for more than one variable
- Why I can't get an answer for the Ship Puzzle with Prolog?
- Evaluate a number in (a few) natural language
- Prolog binding arguments
Trending Questions
- UIImageView Frame Doesn't Reflect Constraints
- Is it possible to use adb commands to click on a view by finding its ID?
- How to create a new web character symbol recognizable by html/javascript?
- Why isn't my CSS3 animation smooth in Google Chrome (but very smooth on other browsers)?
- Heap Gives Page Fault
- Connect ffmpeg to Visual Studio 2008
- Both Object- and ValueAnimator jumps when Duration is set above API LvL 24
- How to avoid default initialization of objects in std::vector?
- second argument of the command line arguments in a format other than char** argv or char* argv[]
- How to improve efficiency of algorithm which generates next lexicographic permutation?
- Navigating to the another actvity app getting crash in android
- How to read the particular message format in android and store in sqlite database?
- Resetting inventory status after order is cancelled
- Efficiently compute powers of X in SSE/AVX
- Insert into an external database using ajax and php : POST 500 (Internal Server Error)
Popular # Hahtags
Popular Questions
- How do I undo the most recent local commits in Git?
- How can I remove a specific item from an array in JavaScript?
- How do I delete a Git branch locally and remotely?
- Find all files containing a specific text (string) on Linux?
- How do I revert a Git repository to a previous commit?
- How do I create an HTML button that acts like a link?
- How do I check out a remote Git branch?
- How do I force "git pull" to overwrite local files?
- How do I list all files of a directory?
- How to check whether a string contains a substring in JavaScript?
- How do I redirect to another webpage?
- How can I iterate over rows in a Pandas DataFrame?
- How do I convert a String to an int in Java?
- Does Python have a string 'contains' substring method?
- How do I check if a string contains a specific word?
I would argue that while the workings are probably the same (haven't done any tests, but I don't expect any speed differences), the former is imho slightly more descriptive. That one says, execute if
num
is not divisible by 2. The latter one says, execute ifnum
divided by 2 gives a remainder of one. While it may be completely equivalent for integers in this case, when using divisors greater than 2, having a remainder of 1 does not cover all cases wherenum
is not divisible byx
. Note that there is a case where you definitely should use the latter: when interested only in odd numbers and your inputs may be floats. I would consider 1.1 to be not odd (though not even either), but it has a remainder unequal to 0 when divided by 2.