Search With Seek4Info.com
Welcome to collectivesolver - Programming & Software Q&A with code examples. A website with trusted programming answers. All programs are tested and work.

Contact: aviboots(AT)netvision.net.il

Buy a domain name - Register cheap domain names from $0.99 - Namecheap

Scalable Hosting That Grows With You

Secure & Reliable Web Hosting, Free Domain, Free SSL, 1-Click WordPress Install, Expert 24/7 Support

Semrush - keyword research tool

Boost your online presence with premium web hosting and servers

Most popular tags

python java c c# cpp javascript php vb# typescript nodejs go rust scala swift kotlin html pascal dart ruby r css bootstrap groovy sql win32 mysql winapi jquery lua winforms pascal-string bash kotlin-string swift-string c-string cpp-string f# opengl go-string cpp-vector pascal-array php-string c#-string vbnet-string swift-array java-string rust-string python-string scala-string javascript-string php-array c-array javascript-array typescript-string cobol rust-vector typescript-array scala-array reactjs python-list c-windows kotlin-array go-array nodejs-string nodejs-array sdl2 cpp-matrix c-matrix cpp-array pascal-matrix c#-list vbnet-list swift-matrix c#-matrix c#-array java-array nodejs-express kotlin-matrix go-slice sdl3 angularjs rust-matrix go-matrix typescript-matrix vbnet-array scala-matrix javascript-matrix php-matrix kotlin-list raylib glfw vbnet-matrix python-matrix java-matrix javascript-regex scala-list java-list typescript-regex freeglut html5
Disclosure: My content contains affiliate links.

38,636 questions

50,322 answers

573 users

How to convert digits of an integer into an array of base 2 digits with least significant digit first in Ruby



232 views
asked Oct 18, 2021 by avibootz
Share on
share on gp share on fb share on tw share on li share on re share via email

1 Answer

0 votes 
n = 12 # 1100
 
arr = n.digits(2)
 
print arr
 
 
 
  
  
#
# run:
# 
# [0, 0, 1, 1]
#

 



answered Oct 18, 2021 by avibootz

Related questions

 | Search With Seek4Info.com
Powered by Question2Answer
...