Inspired by this Rosetta Code article.

Introduction

Balanced Ternary is a method of representing integers using -1, 0 and 1 in base 3.

Decimal 11 = (1 * 3²) + (1 * 3¹) + (−1 * 3⁰) = [1,1,-1] or "++-"

Decimal 6 = (1 * 3²) + (−1 * 3¹) + (0 * 3⁰) = [1,-1,0] or "+-0"

Task

Given any integer, you must give its balanced ternary representation in any permitted format (array, string, etc.)

Your program must support all integers present within its maximum integer limit.

Test Cases

Reference implementation with first 200 values

5 +--
6 +-0
11 ++-
65 +-++-
-44 -++0+
-540 -+-+000

Scoring

This is code-golf. Shortest answer in each language wins.

posted over 3 years ago

CC BY-SA 4.0

Razetime‭

2870 reputation 42 65 322 83