just a caesar cipher... with a twist [closed]

Question

I have been going to puzzling.se, and people over there write stuff in rot13 a lot, sot this gave me an idea:
Write a program that takes 2 inputs, a string and integer:

1. the message to encode or decode
2. how far to shift

You can input in a function call, and output in any legal way twist:
it must work with any printable ascii character. Example code:

def ceasar_cipher(message,shift):
    o = ""
    for n in message:
        o+=(chr(ord(n)+shift))
    return o

python 3 examples:

input:

ceasar_cipher(“hello, world”,13):

output:

"uryy|9-\x84|\x7fyq."

This is code-golf, so shortest code in bytes wins.
The output should be a string
-Can raise an error if it will go past ASCII-characters, or just not shift said characters
Good luck!

Answer 1

BQN, 1 byte

Anonymous tacit infix function. Order of arguments doesn't matter.

+

Try BQN!

Answer 2

05AB1E, 4 3 bytes

^{crossed out 4 is still regular 4 ;(}

-1 byte thanks to @Kevin Cruijssen.

Ç+ç

Try it online!

Ç+ç  # full program
 +   # increment...
Ç    # charcodes of...
     # implicit input
 +   # by...
     # implicit input
  ç  # convert to chars
     # implicit output

Answer 3

K, 4 bytes

Anonymous tacit function taking two arguments in any order.

`c$+

Try K!

+ add the arguments (this implicitly converts the characters to code points

…$ cast to…

 `c character

Answer 4

C (gcc), 32 bytes

f(s,n)char*s;{for(;*s;*s+++=n);}

Try it online!

Answer 5

Wolfram Language (Mathematica), 40 bytes

FromCharacterCode[ToCharacterCode@#+#2]&

Try it online!

Answer 6

Vyxal, s, 3 bytes

C+C

Explained

C     # Convert input string to a list of ord values
 +    # Add implicit number shift
  C   # Convert back to a list of chars and output

If it must absolutely be a function:

7 bytes

λ2|C+C;

Explained

λ2|C+C;
λ2|      # Start a lambda with two arguments
   C+C   # Same as the full program
      ;  # Close lambda

Answer 7

Stax, 4 bytes

{n+m

Run and debug it

a downside of m printing stuff with newline is that you need an explicit bracket.

Answer 8

Jelly, 3 bytes

O+Ọ

Try it online!

Explanation

O+Ọ  Main Link
O    chr->ord of left argument
 +   add (left with right; implicit vectorization)
  Ọ  ord->chr of left argument

Answer 9

Charcoal, 8 bytes

⭆η℅⁺Ｉθ℅ι

Try it online! Link is to verbose version of code. Explanation:

 η          Second input
⭆           Map over characters and join
       ι    Current character
      ℅     Ordinal
   ⁺        Plus
     θ      First input
    Ｉ       Cast to integer
  ℅         Character
            Implicitly print

Answer 10

Retina, 18 bytes

"$+"+T` -þ`!-ÿ
0A`

Try it online! Works on all ISO-8859-1 characters as long as the result does not exceed U+00FF. Add 2 bytes to extend the output range to U+07FF. Add a further 2 bytes to extend the output range to UCS-2 characters up to U+FFFF. Explanation:

"$+"+`

Repeat the given number of times.

T` -þ`!-ÿ

Bump all the supported code points up by 1.

0A`

Delete the count.

Answer 11

Husk, 6 bytes

mȯc+⁰c

Try it online!

m       # map over each element in arg 2
 ȯ      # 3 functions:
     c  # convert character to value
   +⁰   # add arg 1
  c     # convert back to character

Answer 12

Ruby 2.7, 33 30 bytes

->w,s{w.bytes.map{(_1+s).chr}}

Try it online!

Returns an array of chars. TIO uses an older version of Ruby, whereas in Ruby 2.7, we've numbered parameters, which saves two bytes.