# Output the sign

Given a number N, output the sign of N:

• If N is positive, output 1
• If N is negative, output -1
• If N is 0, output 0

N will be an integer within the representable range of integers in your chosen language.

## The Catalogue

The Stack Snippet at the bottom of this post generates the catalogue from the answers a) as a list of shortest solution per language and b) as an overall leaderboard.

## Language Name, N bytes


where N is the size of your submission. If you improve your score, you can keep old scores in the headline, by striking them through. For instance:

## Ruby, <s>104</s> <s>101</s> 96 bytes


If there you want to include multiple numbers in your header (e.g. because your score is the sum of two files or you want to list interpreter flag penalties separately), make sure that the actual score is the last number in the header:

## Perl, 43 + 2 (-p flag) = 45 bytes


You can also make the language name a link which will then show up in the snippet:

## [><>](https://esolangs.org/wiki/Fish), 121 bytes


/* Configuration */

var QUESTION_ID = 103822; // Obtain this from the url
// It will be like https://XYZ.stackexchange.com/questions/QUESTION_ID/... on any question page
var COMMENT_FILTER = "!)Q2B_A2kjfAiU78X(md6BoYk";
var OVERRIDE_USER = 8478; // This should be the user ID of the challenge author.

/* App */

return "https://api.stackexchange.com/2.2/questions/" +  QUESTION_ID + "/answers?page=" + index + "&pagesize=100&order=desc&sort=creation&site=codegolf&filter=" + ANSWER_FILTER;
}

}

jQuery.ajax({
method: "get",
dataType: "jsonp",
crossDomain: true,
success: function (data) {
data.items.forEach(function(a) {
});
comment_page = 1;
}
});
}

jQuery.ajax({
method: "get",
dataType: "jsonp",
crossDomain: true,
success: function (data) {
data.items.forEach(function(c) {
if (c.owner.user_id === OVERRIDE_USER)
});
else process();
}
});
}

var SCORE_REG = /<h\d>\s*([^\n,<]*(?:<(?:[^\n>]*>[^\n<]*<\/[^\n>]*>)[^\n,<]*)*),.*?(\d+)(?=[^\n\d<>]*(?:<(?:s>[^\n<>]*<\/s>|[^\n<>]+>)[^\n\d<>]*)*<\/h\d>)/;

function getAuthorName(a) {
return a.owner.display_name;
}

function process() {
var valid = [];

var body = a.body;
if(OVERRIDE_REG.test(c.body))
body = '<h1>' + c.body.replace(OVERRIDE_REG, '') + '</h1>';
});

var match = body.match(SCORE_REG);
if (match)
valid.push({
user: getAuthorName(a),
size: +match[2],
language: match[1],
});
else console.log(body);
});

valid.sort(function (a, b) {
var aB = a.size,
bB = b.size;
return aB - bB
});

var languages = {};
var place = 1;
var lastSize = null;
var lastPlace = 1;
valid.forEach(function (a) {
if (a.size != lastSize)
lastPlace = place;
lastSize = a.size;
++place;

.replace("{{NAME}}", a.user)
.replace("{{LANGUAGE}}", a.language)
.replace("{{SIZE}}", a.size)

var lang = a.language;
lang = jQuery('<a>'+lang+'</a>').text();

languages[lang] = languages[lang] || {lang: a.language, lang_raw: lang, user: a.user, size: a.size, link: a.link};
});

var langs = [];
for (var lang in languages)
if (languages.hasOwnProperty(lang))
langs.push(languages[lang]);

langs.sort(function (a, b) {
if (a.lang_raw.toLowerCase() > b.lang_raw.toLowerCase()) return 1;
if (a.lang_raw.toLowerCase() < b.lang_raw.toLowerCase()) return -1;
return 0;
});

for (var i = 0; i < langs.length; ++i)
{
var language = jQuery("#language-template").html();
var lang = langs[i];
language = language.replace("{{LANGUAGE}}", lang.lang)
.replace("{{NAME}}", lang.user)
.replace("{{SIZE}}", lang.size)
language = jQuery(language);
jQuery("#languages").append(language);
}

}
body {
text-align: left !important;
display: block !important;
}

width: 290px;
float: left;
}

#language-list {
width: 500px;
float: left;
}

font-weight: bold;
}

table td {
}
<script src="https://ajax.googleapis.com/ajax/libs/jquery/2.1.1/jquery.min.js"></script>
<div id="language-list">
<h2>Shortest Solution by Language</h2>
<table class="language-list">
<tr><td>Language</td><td>User</td><td>Score</td></tr>
<tbody id="languages">

</tbody>
</table>
</div>
<tr><td></td><td>Author</td><td>Language</td><td>Size</td></tr>

</tbody>
</table>
</div>
<table style="display: none">
</tbody>
</table>
<table style="display: none">
<tbody id="language-template">
</tbody>
</table>

• This is a trivial challenge with a lot of trivial solutions. There are however some non-trivial solutions too. To voters: Please read the first sentence of this meta post before upvoting builtin functions. – Stewie Griffin Dec 20 '16 at 10:10
• This could probably use a leaderboard. – Martin Ender Dec 20 '16 at 11:13
• @MrLister upvote how you want, but really you should look for creativity instead of code length. – FlipTack Dec 28 '16 at 20:13
• @FlipTack Oh, I thought it was codegolf. – Mr Lister Dec 28 '16 at 20:23
• @MrLister that's the objective winning criterion. but does it really take more effort to type s for a sign builtin, or use some clever bitshifting/maths to work it out? Have a look at this meta post – FlipTack Dec 28 '16 at 20:25

# Python 3, 25 bytes

lambda x:x and(1,-1)[x<0]


Try it online!

Uses a different approach from other python answers

• You could use (x>0)*2-1 instead of (1,-1)[x<0]. – Jonathan Frech Mar 26 '20 at 11:45

# ArnoldC, 498 bytes

IT'S SHOWTIME
HEY CHRISTMAS TREE n
YOU SET US UP 0
GET YOUR ASS TO MARS n
DO IT NOW
I WANT TO ASK YOU A BUNCH OF QUESTIONS AND I WANT TO HAVE THEM ANSWERED IMMEDIATELY
HEY CHRISTMAS TREE m
YOU SET US UP 0
GET TO THE CHOPPER m
HERE IS MY INVITATION n
GET UP n
GET UP 1
ENOUGH TALK
GET TO THE CHOPPER m
HERE IS MY INVITATION m
GET DOWN 1
I LET HIM GO m
GET DOWN 1
ENOUGH TALK
GET TO THE CHOPPER m
HERE IS MY INVITATION m
GET UP 1
I LET HIM GO m
ENOUGH TALK
TALK TO THE HAND m
YOU HAVE BEEN TERMINATED


Try it online!

### Explanation

IT'S SHOWTIME

# n = 0
HEY CHRISTMAS TREE n
YOU SET US UP 0

# n = input
GET YOUR ASS TO MARS n
DO IT NOW
I WANT TO ASK YOU A BUNCH OF QUESTIONS AND I WANT TO HAVE THEM ANSWERED IMMEDIATELY

# m = 0
HEY CHRISTMAS TREE m
YOU SET US UP 0

# m = n + n + 1
GET TO THE CHOPPER m
HERE IS MY INVITATION n
GET UP n
GET UP 1
ENOUGH TALK

# m = ((m - 1) % m) - 1
GET TO THE CHOPPER m
HERE IS MY INVITATION m
GET DOWN 1
I LET HIM GO m
GET DOWN 1
ENOUGH TALK

# m = (m + 1) % m
GET TO THE CHOPPER m
HERE IS MY INVITATION m
GET UP 1
I LET HIM GO m
ENOUGH TALK

# print m
TALK TO THE HAND m

YOU HAVE BEEN TERMINATED

• Sorry, skynet got my computer before I could read the explanation. – Razetime Sep 2 '20 at 2:26

# asm2bf, 91 bytes

Takes input as a string on the input (i.e. 1234). Assumes no leading zeros.

in_ r1
mov r2,r1
eq_ r2,.0
eq_ r1,.-
jnz r1,%m
jnz r2,%z
out .+
end
@m
out .-
end
@z
out .0


Try it online!

# 8th, 40 3 bytes

With 8th is quite simple to get the sign of N, which is left on TOS

sgn


Testing and Output

ok> 42 sgn .
1
ok> -42 sgn .
-1
ok> 0 sgn .
0


The following code, as an alternative, has the same behaviour of 8th's builtin word n:sgn

: f dup 0; 0 n:> if 1 else -1 then nip ;


Explanation of word f

: f \ n -- -1|0|1
dup     \ Duplicate input
0;      \ Check if number is 0. If true, leave 0 on TOS and exit from word
0 n:>   \ Check if positive
if 1    \ Return 1 if positive
else -1 \ Return -1 if negative
then
nip     \ Get rid of input
;


Testing and Output

ok> 42 f .
1
ok> -42 f .
-1
ok> 0 f .
0


# COW, 153 75 bytes

oomMMMmoOMoOmoOMMMMOOmoOOOOMOomOoMoOmOomOoMOOMOomoOmoOMMMOOOmooMMMmoomoOOOM


Try it online!

COW can't compare numbers so N is stored in two cells, (if N is not 0) in turns one will be increased and the other decreased. When eventually one of them reaches 0, the loop will stop.
The sign will be in the next cell.

## Detailed Explanation:

[0]: N to be incr   [1] = -1   [2]: N to be decr   [3] = 1

i=>+>=          ;   Read N in [0], set [1] = 1 and copy it to [2]
[               ;       Loop while [2] is non-zero
>°-<+<<     ;       Set [3] = -1, increase [2] then point to [0]
[           ;           Loop while [0] is non-zero
->>=°   ;           Decrease [0], point to [2] copy in register and set it to 0 (to exit)
]           ;
=           ;       Paste from register to [2]
]               ;   When exiting the poited cell could be [0] or [1], in either case...
>o              ;   ...move one right and it would contain the correct output

moo ]    mOo <    MOo -    OOO °    OOM i
MOO [    moO >    MoO +    MMM =    oom o


I've tried other permutations of memory cells but this seems the best.
Setting [3] (a constant) inside the loop is needed to manage the case N=0.

# Stax, 2 bytes

:+


Run and debug it

Stax has a sign builtin. Kind of boring. Here's a solution that uses clamp instead

# Stax, 4 bytes

U1:c


Run and debug it

U    push -1 to stack
1   push 1 to stack
:c clamp input between -1 and 1


# Zsh, 17 bytes

<<<$[(n>0)-(n<0)]  Idea from stackoverflow (not copypasta, I still had to use my brain somewhat!) Try it Online! ## Pyke, 5 bytes 0'<>-  Try it here! 0'<> - 0<input, 0>input - - ^-^  # Loader, 61+44+1=106 bytes ### Main module, 61 bytes readline 0 set B =48 load a set B =45 set K -1 load a print 1  ### Module a, 44 bytes decr B decr *0 B:load a ~*0:print K ~*0:exit  # PARI/GP, 4 bytes sign  Another boring built-in. # GameMaker Language, 22 bytes return sign(argument0)  Alternative solutions: return median(1,argument0,-1) a=argument0 return (a>0)-(a<0) a=argument0 return max(-1,min(a,1)) a=argument0 if a return a/abs(a)return 0  ## Clojure, 24 bytes #(cond(> % 0)1(< % 0)-1 0 0)  An anonymous function that checks for being greater than 0, less than 0, then defaults on 0 if neither is true. cond acts as (and is a macro resulting in) an if-else tree. Unfortunately, it requires an even number of arguments, so I had to waste 2 bytes by adding an extra number to mean true to default on. Ungolfed: (defn sign [n] (cond (> n 0) 1 (< n 0) -1 :else 0))  # BotEngine, 7x17=119 v # #0123456789 >Ie~>SSSSSSSSSSS ^ <<<<<<<<<<P PeeS- 1e Pe1-S0123456789 0 > SSSSSSSSS >>>>>>>>>^  ## F#, 31 9 bytes Math.Sign  (Saved 22 bytes thanks to @pmbanka's advice :)) fun(i:int)->System.Math.Sign(i)  I was about to post a C# solution.. but it already exists :( So I decided to have some fun with F#!! //a solution with 24 bytes, but you have to put open System into the file. //Not sure if that would be valid... fun(i:int)->Math.Sign(i)  • I think you don't need to wrap a function inside a lambda. The answer could be as simple as System.Math.Sign, with example usage System.Math.Sign 2 BTW, in F# you don't need to wrap a single argument in a parentheses, saving a byte. And as a side note, I think that C# not counting using System; is a bit weird, but maybe these are the rules here... In such case, assume open System is there as well. – pmbanka Dec 21 '16 at 11:19 • I'm not very familiar with F#, but unless System is imported by default, you have to use the fully-qualified name System.Math.Sign. – user45941 Dec 23 '16 at 14:47 # Go, 49 bytes func s(x int)int{return(x>>63)|int(uint(-x)>>63)}  Note: this won't work on the playground until Go 1.8 is released due to this bug: https://github.com/golang/go/issues/16203 • Possibly doesn't work for the minimum integer (-1<<63)? – Neil Dec 21 '16 at 10:30 • @Neil nope! Should work for all 64 bit integers. – Eric Lagergren Dec 21 '16 at 16:12 • Oh, I see now, you just get -1|1 in that case, which is still -1. – Neil Dec 21 '16 at 20:13 # OCaml, 4 bytes sign  Didn't even know there was a built-in for this. Alternative 18 bytes solution: fun x->compare x 0  # Stacked, 4 bytes sign  Takes input from top of stack. Bonafide function: $sign


Shortest non-builtin so far:

:0>\0<-


Which does:

:0>\0<-                        stack: [..., n]
:        duplicate TOS         stack: [..., n, n]
0       push 0                stack: [..., n, n, 0]
>      pop n,0 and push n>0  stack: [..., n, n>0]
\     switch top two        stack: [..., n>0, n]
0    push 0                stack: [..., n>0, n, 0]
<   pop n,0 and push n<0  stack: [..., n>0, n<0]
-  subtract top two      stack: [..., (n>0)-(n<0)]


Surround with [] to be a function.

# TI-Basic, 11 bytes

:Input A
:A>0
:Ans-A<0


:A>0            // Reads from A, returns 0 or 1
:Ans-A<0.   // Computes A<0 first, then subtracts from previous result. Implicit print.

• To be fair, the other TI-Basic Answer used Ans for input, which decreases his code by 3 bytes. You could add 3 bytes to both of ours through Input A: then use the same metric. – Julian Lachniet Dec 23 '16 at 13:30

# JavaScript (ES6), 14 bytes

No conditionals, no Math lib usage

x=>(x>0)-(x<0)


## Explanation

x > 0 is true/false for positives/non-positives and cast to number (1/0) in case for subtraction. x < 0 is analogous for negatives, so we end up with 1-0 for positives, 0-0 for zero and 0-1 for negatives.

# Math++, 28 bytes

?>a
3+2*!a>$a/sqrta*a 0>$
0

• Could you link to an interpreter? – user45941 Dec 23 '16 at 15:01

# Python 2, 26 Bytes

b=input()
print(b>0)-(b<0)


# Factor, 71 bytes

Expects a string.

[ 0 swap nth { { CHAR: - [ -1 ] } { CHAR: 0 [ 0 ] } [ drop 1 ] } case ]


ungolfed:

: sign-of ( x -- y ) 0 swap nth
{
{ CHAR: - [ -1 ] }
{ CHAR: 0 [ 0 ] }
[ drop 1 ]
} case ;


## Python 3, 29 bytes

lambda a:(a>>31)|a


Tested--it works. EDIT: Sigh...8 more bytes because the previous solution was taken. EDIT 2: Fixed a bug. EDIT 3: Knocked 10 bytes off. Now this is shorter than the one that was already taken!

• This solution already exists – user45941 Dec 23 '16 at 21:39
• Darn it! Should I change my solution? – python-b5 Dec 23 '16 at 21:43
• Yes, please. Either delete it, or edit it to be distinct. – user45941 Dec 23 '16 at 21:43
• You can keep your original answer if you wish, duplicate answers are allowed. – xnor Dec 25 '16 at 8:54
• This fails on positive inputs. – isaacg Jan 11 '17 at 8:12

# MS Excel, 9 Bytes

Takes Input from cell A1.

=SIGN(A1)


# Symbolic Python, 24 bytes

Like many other solutions, this uses the formula s(x) = (x > 0) - (x < 0). Note that this solution is non-competing as the language postdates the challenge.

__={}>{}
_=(_>__)-(_<__)


Symbolic Python is a restricted source version of Python: all alphanumeric characters are banned.

The interpreter automatically puts input in the variable _. From there, the code works like so:

• {}>{} generates the value False. This is then assigned to the variable __. Although it's technically a boolean, we use this as the integer 0:
• (_>__) checks whether the input is greater than 0. (_<__) checks whether the input is smaller than 0. These booleans are then interpreted as integers, and the first is subtracted from the second.
• The result of this is put in the variable _, which is automatically printed after execution.

## Ruby, 19 bytes

Not quite as golfy as my other answer.

->n{("%+b"%n)[0,2]}


Outputs -1, +0, +1

# Japt, 1 byte (non-competing)

g


Try it online!

# tcl 24 23

puts [expr $n<0?-1:$n>0]


Thanks to http://wiki.tcl.tk/819 page authors!

UPDATE: based on the C answer https://codegolf.stackexchange.com/a/103831/29325

puts [expr !!$n|$n>>31]


can be run on http://rextester.com/live/BKGZ8868 where i tested with -9,0,9

# Fourier, 18 17 bytes

I~A<0{1}{-}A/Ao


Try it on FourIDE!

Explanation pseudocode:

A = Input
If A<0 Then
Print "-"
End If
Print A/A


# MY, 3 bytes

Hex:

 1A #Input integer
2A #Sign function
27 #Output (trailing newline)