Anyone Good in LISP??

Discussion in 'Software' started by mattv6603, Oct 1, 2006.

  1. mattv6603

    mattv6603 Private E-2

    Hi,

    I'm trying to implement a binary recursive function....

    I understand how to convert a number to binary, however recursively.... well... I'm just confused.. I was able to get the two termination statements I needed to do to work..

    Does anyone have any idea how they would write a binary function to convert a number to binary? If your fimilar with LISP, I've tried dividing the number then if its odd I print a 0 and if its even I print a 1..

    Thanks in advance..
     

MajorGeeks.Com Menu

Downloads All In One Tweaks \ Android \ Anti-Malware \ Anti-Virus \ Appearance \ Backup \ Browsers \ CD\DVD\Blu-Ray \ Covert Ops \ Drive Utilities \ Drivers \ Graphics \ Internet Tools \ Multimedia \ Networking \ Office Tools \ PC Games \ System Tools \ Mac/Apple/Ipad Downloads

Other News: Top Downloads \ News (Tech) \ Off Base (Other Websites News) \ Way Off Base (Offbeat Stories and Pics)

Social: Facebook \ YouTube \ Twitter \ Tumblr \ Pintrest \ RSS Feeds