83
\$\begingroup\$

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.

To make sure that your answer shows up, please start your answer with a headline, using the following Markdown template:

## 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 ANSWER_FILTER = "!t)IWYnsLAZle2tQ3KqrVveCRJfxcRLe";
var COMMENT_FILTER = "!)Q2B_A2kjfAiU78X(md6BoYk";
var OVERRIDE_USER = 8478; // This should be the user ID of the challenge author.

/* App */

var answers = [], answers_hash, answer_ids, answer_page = 1, more_answers = true, comment_page;

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

function commentUrl(index, answers) {
  return "https://api.stackexchange.com/2.2/answers/" + answers.join(';') + "/comments?page=" + index + "&pagesize=100&order=desc&sort=creation&site=codegolf&filter=" + COMMENT_FILTER;
}

function getAnswers() {
  jQuery.ajax({
    url: answersUrl(answer_page++),
    method: "get",
    dataType: "jsonp",
    crossDomain: true,
    success: function (data) {
      answers.push.apply(answers, data.items);
      answers_hash = [];
      answer_ids = [];
      data.items.forEach(function(a) {
        a.comments = [];
        var id = +a.share_link.match(/\d+/);
        answer_ids.push(id);
        answers_hash[id] = a;
      });
      if (!data.has_more) more_answers = false;
      comment_page = 1;
      getComments();
    }
  });
}

function getComments() {
  jQuery.ajax({
    url: commentUrl(comment_page++, answer_ids),
    method: "get",
    dataType: "jsonp",
    crossDomain: true,
    success: function (data) {
      data.items.forEach(function(c) {
        if (c.owner.user_id === OVERRIDE_USER)
          answers_hash[c.post_id].comments.push(c);
      });
      if (data.has_more) getComments();
      else if (more_answers) getAnswers();
      else process();
    }
  });  
}

getAnswers();

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

var OVERRIDE_REG = /^Override\s*header:\s*/i;

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

function process() {
  var valid = [];
  
  answers.forEach(function(a) {
    var body = a.body;
    a.comments.forEach(function(c) {
      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],
        link: a.share_link,
      });
    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;
    
    var answer = jQuery("#answer-template").html();
    answer = answer.replace("{{PLACE}}", lastPlace + ".")
                   .replace("{{NAME}}", a.user)
                   .replace("{{LANGUAGE}}", a.language)
                   .replace("{{SIZE}}", a.size)
                   .replace("{{LINK}}", a.link);
    answer = jQuery(answer);
    jQuery("#answers").append(answer);

    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)
                       .replace("{{LINK}}", lang.link);
    language = jQuery(language);
    jQuery("#languages").append(language);
  }

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

#answer-list {
  padding: 10px;
  width: 290px;
  float: left;
}

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

table thead {
  font-weight: bold;
}

table td {
  padding: 5px;
}
<script src="https://ajax.googleapis.com/ajax/libs/jquery/2.1.1/jquery.min.js"></script>
<link rel="stylesheet" type="text/css" href="https://cdn.sstatic.net/Sites/codegolf/all.css?v=ffb5d0584c5f">
<div id="language-list">
  <h2>Shortest Solution by Language</h2>
  <table class="language-list">
    <thead>
      <tr><td>Language</td><td>User</td><td>Score</td></tr>
    </thead>
    <tbody id="languages">

    </tbody>
  </table>
</div>
<div id="answer-list">
  <h2>Leaderboard</h2>
  <table class="answer-list">
    <thead>
      <tr><td></td><td>Author</td><td>Language</td><td>Size</td></tr>
    </thead>
    <tbody id="answers">

    </tbody>
  </table>
</div>
<table style="display: none">
  <tbody id="answer-template">
    <tr><td>{{PLACE}}</td><td>{{NAME}}</td><td>{{LANGUAGE}}</td><td>{{SIZE}}</td><td><a href="{{LINK}}">Link</a></td></tr>
  </tbody>
</table>
<table style="display: none">
  <tbody id="language-template">
    <tr><td>{{LANGUAGE}}</td><td>{{NAME}}</td><td>{{SIZE}}</td><td><a href="{{LINK}}">Link</a></td></tr>
  </tbody>
</table>

\$\endgroup\$
12
  • 50
    \$\begingroup\$ 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. \$\endgroup\$ Commented Dec 20, 2016 at 10:10
  • 9
    \$\begingroup\$ This could probably use a leaderboard. \$\endgroup\$ Commented Dec 20, 2016 at 11:13
  • 3
    \$\begingroup\$ @MrLister upvote how you want, but really you should look for creativity instead of code length. \$\endgroup\$
    – FlipTack
    Commented Dec 28, 2016 at 20:13
  • 3
    \$\begingroup\$ @FlipTack Oh, I thought it was codegolf. \$\endgroup\$
    – Mr Lister
    Commented Dec 28, 2016 at 20:23
  • 4
    \$\begingroup\$ @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 \$\endgroup\$
    – FlipTack
    Commented Dec 28, 2016 at 20:25

193 Answers 193

1
3 4 5 6
7
0
\$\begingroup\$

Husk, 1 byte

±

Try it online!

\$\endgroup\$
0
\$\begingroup\$

Implicit, 1 byte

±

Try it online!

After implicits, this program looks like:

$±%
$    read integer input
 ±   push sign
  %  print
\$\endgroup\$
0
\$\begingroup\$

REXX, 16 bytes

say sign(arg(1))
\$\endgroup\$
0
\$\begingroup\$

Add++, 9 bytes

L,d0<@0>_

Try it online!

How it works

L,  - Create a lambda.
           Example argument: -8
  d - Duplicate;    STACK = [-8 -8]
  0 - Push 0;       STACK = [-8 -8 0]
  < - Less than;    STACK = [-8  0]
  @ - Reverse;      STACK = [ 0 -8]
  0 - Push 0;       STACK = [ 0 -8 0]
  > - Greater than; STACK = [ 0  1]
  _ - Subtract;     STACK = [-1]
      Implicitly return      -1
\$\endgroup\$
0
\$\begingroup\$

Deorst, 11 bytes

i:l0<@l0>@-

Try it online!

Boring (n>0)-(n<0) solution

\$\endgroup\$
0
\$\begingroup\$

x86_64 machine code - 26 24 bytes

This is callable function, input in r8 output in rax.

-3 bytes using cbw instruction is 2 bytes instead of movzx rax, al is 4 bytes.

0000000000400080 <output_the_sign>:
  400080:   48 31 c0                xor    rax,rax
  400083:   4d 85 c0                test   r8,r8
  400086:   74 11                   je     400099 <output_the_sign.done>
  400088:   0f 95 c0                setne  al
  40008b:   66 98                   cbw
  40008f:   4c 89 c2                mov    rdx,r8
  400092:   48 c1 fa 1f             sar    rdx,0x1f
  400096:   48 09 d0                or     rax,rdx

0000000000400099 <output_the_sign.done>:
  400099:   c3                      ret    

Try it online!

\$\endgroup\$
0
\$\begingroup\$

x86, 9 bytes

97    xchg eax, edi
99    cdq
92    xchg eax, edx
39 C2 cmp  edx, eax
7E 01 jng  $+3 ; --,
40    inc  eax ;   |
C3    ret      ; <-'

Try it online!

No one posted this

\$\endgroup\$
0
\$\begingroup\$

Vyxal, 1 byte

±

Try it Online!

\$\endgroup\$
1
  • 3
    \$\begingroup\$ There's an identical answer from Aaron Miller on this question. \$\endgroup\$
    – Razetime
    Commented Apr 21, 2021 at 8:51
0
\$\begingroup\$

Julia, 4 bytes

sign

Try it online!

trivial built-in but it was missing here

Julia (without sign)

round∘tanh 12 bytes

x->tanh(99x) 12 bytes

x->tanh(9x) 11 bytes (input must be Float32)

\$\endgroup\$
0
\$\begingroup\$

GNU AWK, 15 bytes

sub(/\w+/,!!$0)

Try it online!

The efforts in golfing James Brown's code brought me to this answer. It is exclusive to GNU AWK, due to the use of \w.

AWK, 16 bytes

!$0||$0=/-/?-1:1

Try it online!

This works in traditional AWK.

\$\endgroup\$
4
  • \$\begingroup\$ '$0=_!!$0-2*/-/' this should work for 14 bytes for any awk by skipping the function call, the logical OR ("||"), and the ternary, and using a forced string concat to handle the cases when it's zero \$\endgroup\$ Commented Sep 20, 2023 at 13:43
  • \$\begingroup\$ actually it would be $_=_!!$_-2*/-/ for gawk :::::::::::::::: $0=_!!$_-2*/-/ for mawk ::::::::::::::::::: $0=_!!$0-2*(/-/) for nawk :::::::::::::::::::::::: ::::::::::::::: :::::::::::::::: :::::::::::: :::::: :::::::::: 16 bytes for nawk, 14 bytes for any other awk. \$\endgroup\$ Commented Sep 20, 2023 at 13:48
  • \$\begingroup\$ also works if the string concat is appended instead of pre-pended ::::::::::::::::::: :::::::::::::::::::::: ::::::::::::: $_=!!$_-2*/-/_ \$\endgroup\$ Commented Sep 20, 2023 at 13:51
  • \$\begingroup\$ oh turns out one could even skip the negation by switching it to a less than (<) comparison - ::::: same 14 bytes, but doesn't need any hard-coded numbers anymore :::::::::::::::: : $_=(_<$_)-/-/_ . It never ceases to amaze me that this is actually posix-compliant code \$\endgroup\$ Commented Sep 20, 2023 at 14:20
0
\$\begingroup\$

COBOL (GNU), 68 bytes

S.
SET O TO 0
IF X > 0
SET O TO 1
ELSE IF X < 0
SET O TO -1
END-IF.

Try it online!

\$\endgroup\$
0
\$\begingroup\$

Swift, 23 bytes

let s={($0+0).signum()}

There is absolutely nothing interesting about this.

\$\endgroup\$
-2
\$\begingroup\$

awk

jot 11 -5 | 

gawk 'func __(_){return(-_<_)-(_<-_)}'

-5 -1
-4 -1
-3 -1
-2 -1
-1 -1
0 0
1 1
2 1
3 1
4 1
5 1
\$\endgroup\$
0
1
3 4 5 6
7

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.