How to resolve the algorithm Population count step by step in the Sidef programming language

Published on 12 May 2024 09:40 PM

How to resolve the algorithm Population count step by step in the Sidef programming language

Table of Contents

Problem Statement

The   population count   is the number of   1s   (ones)   in the binary representation of a non-negative integer. Population count   is also known as:

For example,   5   (which is   101   in binary)   has a population count of   2.

Evil numbers   are non-negative integers that have an   even   population count. Odious numbers     are  positive integers that have an    odd   population count.

Let's start with the solution:

Step by Step solution about How to resolve the algorithm Population count step by step in the Sidef programming language

Source code in the sidef programming language

func population_count(n) { n.as_bin.count('1') }
say "#{0..29 «**« 3 «call« population_count -> join(' ')}"
 
var numbers = 60.of { |i|
    [i, population_count(i)]
}
 
say "Evil:   #{numbers.grep{_[1] %% 2}.map{.first}.join(' ')}"
say "Odious: #{numbers.grep{_[1] &  1}.map{.first}.join(' ')}"


  

You may also check:How to resolve the algorithm Inheritance/Multiple step by step in the Nim programming language
You may also check:How to resolve the algorithm Hello world/Newline omission step by step in the OOC programming language
You may also check:How to resolve the algorithm Arrays step by step in the Lasso programming language
You may also check:How to resolve the algorithm Doubly-linked list/Element definition step by step in the Delphi programming language
You may also check:How to resolve the algorithm Aliquot sequence classifications step by step in the Phix programming language