Skip to content

Optimal algorythm of counting ones in 2-base representation of number between two given

Notifications You must be signed in to change notification settings

IgorZhurbenko/Count1sWithin

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

7 Commits
 
 
 
 
 
 
 
 

Repository files navigation

Count sum of all ones of all numbers in 2-base representation between two numbers inclusively
Problem taken from https://www.codewars.com/kata/count-ones-in-a-segment/c
Solved. Operates light-fast thanks to deep optimization made instead of upfront solution.

About

Optimal algorythm of counting ones in 2-base representation of number between two given

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published