Answers for "how to reach from n to 1 by either dividing by or multiplying by"

Python

1

minimum-number-of-steps-to-reduce-number-to-1

#minimum-number-of-steps-to-reduce-number-to-1
def stepCount(n):
    count = 0
    while n > 1:
        if n % 2 == 0:             # bitmask: *0
            n = n // 2
        elif n == 3 or n % 4 == 1: # bitmask: 01
            n = n - 1
        else:                      # bitmask: 11
            n = n + 1
        count += 1
    return count

Posted by: Guest on May-09-2020

Source

Code answers related to "how to reach from n to 1 by either dividing by or multiplying by"

Code answers related to "Python"

Python Answers by Framework

Django
Flask

Browse Popular Code Answers by Language

Python

Javascript

Whatever

Shell/Bash

CSS

Html

PHP

SQL

Java

C#