mlfoundations-dev/load_in_code_rosetta · Data Studio

task_url stringlengths 30 116	task_name stringlengths 2 86	task_description stringlengths 0 14.4k	language_url stringlengths 2 53	language_name stringlengths 1 52	code stringlengths 0 61.9k	instruction_seed stringlengths 27 14.4k	_source stringclasses 1 value
http://rosettacode.org/wiki/Five_weekends	Five weekends	The month of October in 2010 has five Fridays, five Saturdays, and five Sundays. Task Write a program to show all months that have this same characteristic of five full weekends from the year 1900 through 2100 (Gregorian calendar). Show the number of months with this property (there should be 201). Show at leas...	#Euphoria	Euphoria	--Five Weekend task from Rosetta Code wiki --User:Lnettnay include std/datetime.e atom numbermonths = 0 sequence longmonths = {1, 3, 5, 7, 8, 10, 12} sequence yearsmonths = {} atom none = 0 datetime dt for year = 1900 to 2100 do atom flag = 0 for month = 1 to length(longmonths) do dt = new(year, longmonths...	Give a code snippet in #Euphoria The month of October in 2010 has five Fridays, five Saturdays, and five Sundays. Task Write a program to show all months that have this same characteristic of five full weekends from the year 1900 through 2100 (Gregorian calendar). Show the number of months with this property (t...	christopher/rosetta-code
http://rosettacode.org/wiki/Loops/For_with_a_specified_step	Loops/For with a specified step	Task Demonstrate a for-loop where the step-value is greater than one. Related tasks Loop over multiple arrays simultaneously Loops/Break Loops/Continue Loops/Do-while Loops/Downward for Loops/For Loops/For with a specified step Loops/Foreach Loops/Increment loop index within loop b...	#Erlang	Erlang	%% Implemented by Arjun Sunel %% for_loop/4 by Bengt Kleberg. -module(loop_step). -export([main/0, for_loop/1, for_loop/4]). % This Erlang code for "For Loop" is equivalent to: " for (i=start; i<end ; i=i+2){ printf("* ");} " in C language. main() -> for_loop(1). for_loop( N ) -> for_loop( N, 4, 2, fun(...	Give a code snippet in #Erlang Task Demonstrate a for-loop where the step-value is greater than one. Related tasks Loop over multiple arrays simultaneously Loops/Break Loops/Continue Loops/Do-while Loops/Downward for Loops/For Loops/For with a specified step Loops/Foreach Loops/In...	christopher/rosetta-code
http://rosettacode.org/wiki/Sequence_of_non-squares	Sequence of non-squares	Task Show that the following remarkable formula gives the sequence of non-square natural numbers: n + floor(1/2 + sqrt(n)) Print out the values for n in the range 1 to 22 Show that no squares occur for n less than one million This is sequence A000037 in the OEIS database.	#R	R	nonsqr <- function(n) n + floor(1/2 + sqrt(n)) nonsqr(1:22)	Give a code snippet in #R Task Show that the following remarkable formula gives the sequence of non-square natural numbers: n + floor(1/2 + sqrt(n)) Print out the values for n in the range 1 to 22 Show that no squares occur for n less than one million This is sequence A000037 ...	christopher/rosetta-code
http://rosettacode.org/wiki/Zig-zag_matrix	Zig-zag matrix	Task Produce a zig-zag array. A zig-zag array is a square arrangement of the first N2 natural numbers, where the numbers increase sequentially as you zig-zag along the array's anti-diagonals. For a graphical representation, see JPG zigzag (JPG uses such arrays to encode images). For example, gi...	#Inspired_by_Rascal	Inspired by Rascal	#{ Produce a zigzag matrix. Nigel Galloway, January 26th., 2020. At the time of writing the Rascal solution is yellow flagged for producing a striped matrix. Let me make the same faux pas. #} n=5; g=1; for e=1:n i=1; for l=e:-1:1 zig(i++,l)=g++; endfor endfor for e=2:n i=e; for l=n:-1:e zig(i++,l)=g++; endfor en...	Give a code snippet in #Inspired_by_Rascal Task Produce a zig-zag array. A zig-zag array is a square arrangement of the first N2 natural numbers, where the numbers increase sequentially as you zig-zag along the array's anti-diagonals. For a graphical representation, see JPG zigzag (JPG uses such ...	christopher/rosetta-code
http://rosettacode.org/wiki/Hamming_numbers	Hamming numbers	Hamming numbers are numbers of the form H = 2i × 3j × 5k where i, j, k ≥ 0 Hamming numbers are also known as ugly numbers and also 5-smooth numbers (numbers whose prime divisors are less or equal to 5). Task Generate the sequence of Hamming numbers, in increasing order. In ...	#ATS	ATS	// // How to compile: // patscc -DATS_MEMALLOC_LIBC -o hamming hamming.dats // #include "share/atspre_staload.hats" fun min3 ( A: arrayref(int, 3) ) : natLt(3) = i where { var x: int = A[0] var i: natLt(3) = 0 val () = if A[1] < x then (x := A[1]; i := 1) val () = if A[2] < x then (x := A[2]; i := 2) } (*...	Give a code snippet in #ATS Hamming numbers are numbers of the form H = 2i × 3j × 5k where i, j, k ≥ 0 Hamming numbers are also known as ugly numbers and also 5-smooth numbers (numbers whose prime divisors are less or equal to 5). Task Generate the sequence of Hamming number...	christopher/rosetta-code
http://rosettacode.org/wiki/Ruth-Aaron_numbers	Ruth-Aaron numbers	A Ruth–Aaron pair consists of two consecutive integers (e.g., 714 and 715) for which the sums of the prime divisors of each integer are equal. So called because 714 is Babe Ruth's lifetime home run record; Hank Aaron's 715th home run broke this record and 714 and 715 have the same prime divisor sum. A Ruth–Aaron tri...	#Pascal	Pascal	program RuthAaronNumb; // gets factors of consecutive integers fast // limited to 1.2e11 {$IFDEF FPC} {$MODE DELPHI} {$OPTIMIZATION ON,ALL} {$COPERATORS ON} {$ELSE} {$APPTYPE CONSOLE} {$ENDIF} uses sysutils, strutils //Numb2USA {$IFDEF WINDOWS},Windows{$ENDIF} ; //###########################################...	Give a code snippet in #Pascal A Ruth–Aaron pair consists of two consecutive integers (e.g., 714 and 715) for which the sums of the prime divisors of each integer are equal. So called because 714 is Babe Ruth's lifetime home run record; Hank Aaron's 715th home run broke this record and 714 and 715 have the same prime ...	christopher/rosetta-code
http://rosettacode.org/wiki/Priority_queue	Priority queue	A priority queue is somewhat similar to a queue, with an important distinction: each item is added to a priority queue with a priority level, and will be later removed from the queue with the highest priority element first. That is, the items are (conceptually) stored in the queue in priority order instead of in insert...	#F.23	F#	[<RequireQualifiedAccess>] module PriorityQ = // type 'a treeElement = Element of uint32 * 'a type 'a treeElement = struct val k:uint32 val v:'a new(k,v) = { k=k;v=v } end type 'a tree = Node of uint32 * 'a treeElement * 'a tree list type 'a heap = 'a tree list [<CompilationRepresentation(CompilationRe...	Give a code snippet in #F.23 A priority queue is somewhat similar to a queue, with an important distinction: each item is added to a priority queue with a priority level, and will be later removed from the queue with the highest priority element first. That is, the items are (conceptually) stored in the queue in prior...	christopher/rosetta-code
http://rosettacode.org/wiki/Random_number_generator_(included)	Random number generator (included)	The task is to: State the type of random number generator algorithm used in a language's built-in random number generator. If the language or its immediate libraries don't provide a random number generator, skip this task. If possible, give a link to a wider explanation of the algorithm used. Note: the task is not t...	#Nanoquery	Nanoquery	setrand(3) random(6)+1 \\ chosen by fair dice roll. \\ guaranteed to the random.	Give a code snippet in #Nanoquery The task is to: State the type of random number generator algorithm used in a language's built-in random number generator. If the language or its immediate libraries don't provide a random number generator, skip this task. If possible, give a link to a wider explanation of the algo...	christopher/rosetta-code
http://rosettacode.org/wiki/Create_a_file	Create a file	In this task, the job is to create a new empty file called "output.txt" of size 0 bytes and an empty directory called "docs". This should be done twice: once "here", i.e. in the current working directory and once in the filesystem root.	#Bracmat	Bracmat	put$(,"output.txt",NEW)	Give a code snippet in #Bracmat In this task, the job is to create a new empty file called "output.txt" of size 0 bytes and an empty directory called "docs". This should be done twice: once "here", i.e. in the current working directory and once in the filesystem root.	christopher/rosetta-code
http://rosettacode.org/wiki/Babbage_problem	Babbage problem	Charles Babbage, looking ahead to the sorts of problems his Analytical Engine would be able to solve, gave this example: What is the smallest positive integer whose square ends in the digits 269,696? — Babbage, letter to Lord Bowden, 1837; see Hollingdale and Tootill, Electronic Computers, second edition, 1970, p....	#Erlang	Erlang	-module(solution1). -export([main/0]). babbage(N,E) when N*N rem 1000000 == 269696 -> io:fwrite("~p",[N]); babbage(N,E) -> case E of 4 -> babbage(N+2,6); 6 -> babbage(N+8,4) end. main()-> babbage(4,4).	Give a code snippet in #Erlang Charles Babbage, looking ahead to the sorts of problems his Analytical Engine would be able to solve, gave this example: What is the smallest positive integer whose square ends in the digits 269,696? — Babbage, letter to Lord Bowden, 1837; see Hollingdale and Tootill, Electronic Com...	christopher/rosetta-code
http://rosettacode.org/wiki/Magic_squares_of_doubly_even_order	Magic squares of doubly even order	A magic square is an N×N square matrix whose numbers consist of consecutive numbers arranged so that the sum of each row and column, and both diagonals are equal to the same sum (which is called the magic number or magic constant). A magic square of doubly even order has a size that is a multiple of four (e...	#J	J	masksq=: >:@#@, \| _1&^ * 1 + i.@$ pat4=: ,:(+.\|.)=i.4 mask=: ,/@(,./"3@$&pat4)@] ,~ % 4: demsq=: masksq@mask	Give a code snippet in #J A magic square is an N×N square matrix whose numbers consist of consecutive numbers arranged so that the sum of each row and column, and both diagonals are equal to the same sum (which is called the magic number or magic constant). A magic square of doubly even order has a size that...	christopher/rosetta-code
http://rosettacode.org/wiki/Factorial	Factorial	Definitions The factorial of 0 (zero) is defined as being 1 (unity). The Factorial Function of a positive integer, n, is defined as the product of the sequence: n, n-1, n-2, ... 1 Task Write a function to return the factorial of a number. Solutions can be iterat...	#Dyalect	Dyalect	func factorial(n) { if n < 2 { 1 } else { n * factorial(n - 1) } }	Give a code snippet in #Dyalect Definitions The factorial of 0 (zero) is defined as being 1 (unity). The Factorial Function of a positive integer, n, is defined as the product of the sequence: n, n-1, n-2, ... 1 Task Write a function to return the factorial of a...	christopher/rosetta-code
http://rosettacode.org/wiki/Cramer%27s_rule	Cramer's rule	linear algebra Cramer's rule system of linear equations Given { a 1 x + b 1 y + c 1 z = d 1 a 2 x + b 2 y + c 2 z = d 2 a 3 x + b 3 y + c 3 z = d 3 {\displaystyle \left\{{\begin{matrix}a_{1}x+b_{1}y+c_{1}z&={\color {red}d_{1...	#Wren	Wren	import "/matrix" for Matrix var cramer = Fn.new { \|a, d\| var n = a.numRows var x = List.filled(n, 0) var ad = a.det for (c in 0...n) { var aa = a.copy() for (r in 0...n) aa[r, c] = d[r, 0] x[c] = aa.det/ad } return x } var a = Matrix.new([ [2, -1, 5, 1], [3,...	Give a code snippet in #Wren linear algebra Cramer's rule system of linear equations Given { a 1 x + b 1 y + c 1 z = d 1 a 2 x + b 2 y + c 2 z = d 2 a 3 x + b 3 y + c 3 z = d 3 {\displaystyle \left\{{\begin{matrix}a_{1}x+b_...	christopher/rosetta-code
http://rosettacode.org/wiki/Function_definition	Function definition	A function is a body of code that returns a value. The value returned may depend on arguments provided to the function. Task Write a definition of a function called "multiply" that takes two arguments and returns their product. (Argument types should be chosen so as not to distract from showing how functions are ...	#AntLang	AntLang	multiply: * /`' is a normal function multiply: {x y}	Give a code snippet in #AntLang A function is a body of code that returns a value. The value returned may depend on arguments provided to the function. Task Write a definition of a function called "multiply" that takes two arguments and returns their product. (Argument types should be chosen so as not to distrac...	christopher/rosetta-code
http://rosettacode.org/wiki/Damm_algorithm	Damm algorithm	The Damm algorithm is a checksum algorithm which detects all single digit errors and adjacent transposition errors. The algorithm is named after H. Michael Damm. Task Verify the checksum, stored as last digit of an input.	#Java	Java	public class DammAlgorithm { private static final int[][] table = { {0, 3, 1, 7, 5, 9, 8, 6, 4, 2}, {7, 0, 9, 2, 1, 5, 4, 8, 6, 3}, {4, 2, 0, 6, 8, 7, 1, 3, 5, 9}, {1, 7, 5, 0, 9, 8, 3, 4, 2, 6}, {6, 1, 2, 3, 0, 4, 5, 9, 7, 8}, {3, 6, 7, 4, 2, 0, 9, 5, 8, 1}, ...	Give a code snippet in #Java The Damm algorithm is a checksum algorithm which detects all single digit errors and adjacent transposition errors. The algorithm is named after H. Michael Damm. Task Verify the checksum, stored as last digit of an input.	christopher/rosetta-code
http://rosettacode.org/wiki/Loops/Do-while	Loops/Do-while	Start with a value at 0. Loop while value mod 6 is not equal to 0. Each time through the loop, add 1 to the value then print it. The loop must execute at least once. Related tasks Loop over multiple arrays simultaneously Loops/Break Loops/Continue Loops/Do-while Loops/Downward for Loops/For Loo...	#Elixir	Elixir	defmodule Loops do def do_while(n) do n1 = n + 1 IO.puts n1 if rem(n1, 6) == 0, do: :ok, else: do_while(n1) end end Loops.do_while(0)	Give a code snippet in #Elixir Start with a value at 0. Loop while value mod 6 is not equal to 0. Each time through the loop, add 1 to the value then print it. The loop must execute at least once. Related tasks Loop over multiple arrays simultaneously Loops/Break Loops/Continue Loops/Do-while Loops/...	christopher/rosetta-code
http://rosettacode.org/wiki/Bitmap/Read_a_PPM_file	Bitmap/Read a PPM file	Using the data storage type defined on this page for raster images, read an image from a PPM file (binary P6 prefered). (Read the definition of PPM file on Wikipedia.) Task: Use write ppm file solution and grayscale image solution with this one in order to convert a color image to grayscale one.	#Perl	Perl	#! /usr/bin/perl use strict; use Image::Imlib2; my $img = Image::Imlib2->load("out0.ppm"); # let's do something with it now $img->set_color(255, 255, 255, 255); $img->draw_line(0,0, $img->width,$img->height); $img->image_set_format("png"); $img->save("out1.png"); exit 0;	Give a code snippet in #Perl Using the data storage type defined on this page for raster images, read an image from a PPM file (binary P6 prefered). (Read the definition of PPM file on Wikipedia.) Task: Use write ppm file solution and grayscale image solution with this one in order to convert a color image to graysca...	christopher/rosetta-code
http://rosettacode.org/wiki/Sailors,_coconuts_and_a_monkey_problem	Sailors, coconuts and a monkey problem	Five sailors are shipwrecked on an island and collect a large pile of coconuts during the day. That night the first sailor wakes up and decides to take his first share early so tries to divide the pile of coconuts equally into five piles but finds that there is one coconut left over, so he tosses it to a monkey and th...	#J	J	I.(=<.)%&5 verb def'4*(y-1)%5'^:5 i.10000 3121	Give a code snippet in #J Five sailors are shipwrecked on an island and collect a large pile of coconuts during the day. That night the first sailor wakes up and decides to take his first share early so tries to divide the pile of coconuts equally into five piles but finds that there is one coconut left over, so he t...	christopher/rosetta-code
http://rosettacode.org/wiki/Create_an_object_at_a_given_address	Create an object at a given address	Basic Data Operation This is a basic data operation. It represents a fundamental action on a basic data type. You may see other such operations in the Basic Data Operations category, or: Integer Operations Arithmetic \| Comparison Boolean Operations Bitwise \| Logical String Operations Concatenation \| Interpolation \|...	#BBC_BASIC	BBC BASIC	REM Create an integer object: anInteger% = 12345678 PRINT "Original value =", anInteger% REM Print the machine address of the object: address% = ^anInteger% PRINT "Hexadecimal address = ";~address% REM Take the address of the object and create REM another integer ob...	Give a code snippet in #BBC_BASIC Basic Data Operation This is a basic data operation. It represents a fundamental action on a basic data type. You may see other such operations in the Basic Data Operations category, or: Integer Operations Arithmetic \| Comparison Boolean Operations Bitwise \| Logical String Operati...	christopher/rosetta-code
http://rosettacode.org/wiki/Currying	Currying	This page uses content from Wikipedia. The original article was at Currying. The list of authors can be seen in the page history. As with Rosetta Code, the text of Wikipedia is available under the GNU FDL. (See links for details on variance) Task Create a simple demonstrative example of Currying in a specific la...	#REXX	REXX	/REXX program demonstrates a REXX currying method to perform addition. / say 'add 2 to 3: ' add(2, 3) say 'add 2 to 3 (curried):' add2(3) exit /stick a fork in it, we're all done. / /*──────────────────────────────────────────────────────────...	Give a code snippet in #REXX This page uses content from Wikipedia. The original article was at Currying. The list of authors can be seen in the page history. As with Rosetta Code, the text of Wikipedia is available under the GNU FDL. (See links for details on variance) Task Create a simple demonstrative exampl...	christopher/rosetta-code
http://rosettacode.org/wiki/Spinning_rod_animation/Text	Spinning rod animation/Text	Task An animation with the following frames in the following order (if certain characters aren't available or can't be used correctly in the programming language, alternate characters can replace any of these frames) must animate with a delay of 0.25 seconds between each frame, with the previous frame being cleared be...	#Rust	Rust	fn main() { let characters = ['\|', '/', '-', '\\']; let mut current = 0; println!("{}[2J", 27 as char); // Clear screen. loop { println!("{}[;H{}", 27 as char, characters[current]); // Move cursor to 1,1 and output the next character. current += 1; // Advance current character. ...	Give a code snippet in #Rust Task An animation with the following frames in the following order (if certain characters aren't available or can't be used correctly in the programming language, alternate characters can replace any of these frames) must animate with a delay of 0.25 seconds between each frame, with the p...	christopher/rosetta-code
http://rosettacode.org/wiki/Exceptions/Catch_an_exception_thrown_in_a_nested_call	Exceptions/Catch an exception thrown in a nested call	Show how to create a user-defined exception and show how to catch an exception raised from several nested calls away. Create two user-defined exceptions, U0 and U1. Have function foo call function bar twice. Have function bar call function baz. Arrange for function baz to rais...	#Mathematica_.2F_Wolfram_Language	Mathematica / Wolfram Language	foo[] := Catch[ bar[1]; bar[2]; ] bar[i_] := baz[i]; baz[i_] := Switch[i, 1, Throw["Exception U0 in baz"];, 2, Throw["Exception U1 in baz"];]	Give a code snippet in #Mathematica_.2F_Wolfram_Language Show how to create a user-defined exception and show how to catch an exception raised from several nested calls away. Create two user-defined exceptions, U0 and U1. Have function foo call function bar twice. Have function bar cal...	christopher/rosetta-code
http://rosettacode.org/wiki/Literals/Integer	Literals/Integer	Some programming languages have ways of expressing integer literals in bases other than the normal base ten. Task Show how integer literals can be expressed in as many bases as your language allows. Note: this should not involve the calling of any functions/methods, but should be interpreted by the compiler or...	#Logtalk	Logtalk	:- object(integers). :- public(show/0). show :- write('Binary 0b11110101101 = '), write(0b11110101101), nl, write('Octal 0o3655 = '), write(0o3655), nl, write('Decimal 1965 = '), write(1965), nl, write('Hexadecimal 0x7AD = '), write(0x...	Give a code snippet in #Logtalk Some programming languages have ways of expressing integer literals in bases other than the normal base ten. Task Show how integer literals can be expressed in as many bases as your language allows. Note: this should not involve the calling of any functions/methods, but should ...	christopher/rosetta-code
http://rosettacode.org/wiki/Vigen%C3%A8re_cipher	Vigenère cipher	Task Implement a Vigenère cypher, both encryption and decryption. The program should handle keys and text of unequal length, and should capitalize everything and discard non-alphabetic characters. (If your program handles non-alphabetic characters in another way, make a note of it.) Related tasks Caesar ...	#Elixir	Elixir	defmodule VigenereCipher do @base ?A @size ?Z - @base + 1 def encrypt(text, key), do: crypt(text, key, 1) def decrypt(text, key), do: crypt(text, key, -1) defp crypt(text, key, dir) do text = String.upcase(text) \|> String.replace(~r/[^A-Z]/, "") \|> to_char_list key_iterator = String.upcase(key...	Give a code snippet in #Elixir Task Implement a Vigenère cypher, both encryption and decryption. The program should handle keys and text of unequal length, and should capitalize everything and discard non-alphabetic characters. (If your program handles non-alphabetic characters in another way, make a note of i...	christopher/rosetta-code
http://rosettacode.org/wiki/Closest-pair_problem	Closest-pair problem	This page uses content from Wikipedia. The original article was at Closest pair of points problem. The list of authors can be seen in the page history. As with Rosetta Code, the text of Wikipedia is available under the GNU FDL. (See links for details on variance) Task Provide a function to find the closest two p...	#Julia	Julia	function closestpair(P::Vector{Vector{T}}) where T <: Number N = length(P) if N < 2 return (Inf, ()) end mindst = norm(P[1] - P[2]) minpts = (P[1], P[2]) for i in 1:N-1, j in i+1:N tmpdst = norm(P[i] - P[j]) if tmpdst < mindst mindst = tmpdst minpts = (P[i], P...	Give a code snippet in #Julia This page uses content from Wikipedia. The original article was at Closest pair of points problem. The list of authors can be seen in the page history. As with Rosetta Code, the text of Wikipedia is available under the GNU FDL. (See links for details on variance) Task Provide a fun...	christopher/rosetta-code
http://rosettacode.org/wiki/Exceptions/Catch_an_exception_thrown_in_a_nested_call	Exceptions/Catch an exception thrown in a nested call	Show how to create a user-defined exception and show how to catch an exception raised from several nested calls away. Create two user-defined exceptions, U0 and U1. Have function foo call function bar twice. Have function bar call function baz. Arrange for function baz to rais...	#C.2B.2B	C++	#include <iostream> class U0 {}; class U1 {}; void baz(int i) { if (!i) throw U0(); else throw U1(); } void bar(int i) { baz(i); } void foo() { for (int i = 0; i < 2; i++) { try { bar(i); } catch(U0 e) { std::cout<< "Exception U0 caught\n"; } } } int ma...	Give a code snippet in #C.2B.2B Show how to create a user-defined exception and show how to catch an exception raised from several nested calls away. Create two user-defined exceptions, U0 and U1. Have function foo call function bar twice. Have function bar call function baz. Arr...	christopher/rosetta-code
http://rosettacode.org/wiki/Show_the_epoch	Show the epoch	Task Choose popular date libraries used by your language and show the epoch those libraries use. A demonstration is preferable (e.g. setting the internal representation of the date to 0 ms/ns/etc., or another way that will still show the epoch even if it is changed behind the scenes by the implementers), b...	#Mathematica.2FWolfram_Language	Mathematica/Wolfram Language	DateString[0]	Give a code snippet in #Mathematica.2FWolfram_Language Task Choose popular date libraries used by your language and show the epoch those libraries use. A demonstration is preferable (e.g. setting the internal representation of the date to 0 ms/ns/etc., or another way that will still show the epoch even if i...	christopher/rosetta-code
http://rosettacode.org/wiki/Reflection/Get_source	Reflection/Get source	Task The goal is to get the source code or file path and line number where a programming object (e.g. module, class, function, method) is defined.	#Smalltalk	Smalltalk	mthd := someClass compiledMethodAt:#nameOfMethod	Give a code snippet in #Smalltalk Task The goal is to get the source code or file path and line number where a programming object (e.g. module, class, function, method) is defined.	christopher/rosetta-code
http://rosettacode.org/wiki/Number_names	Number names	Task Show how to spell out a number in English. You can use a preexisting implementation or roll your own, but you should support inputs up to at least one million (or the maximum value of your language's default bounded integer type, if that's less). Support for inputs other than positive integers (like zero, negat...	#Prolog	Prolog	:- module(spell, [spell/2]). % % spell numbers up to the nonillions. % ones(1, "one"). ones(2, "two"). ones(3, "three"). ones(4, "four"). ones( 5, "five"). ones(6, "six"). ones(7, "seven"). ones(8, "eight"). ones(9, "nine"). ones(10, "ten"). ones(11, "eleven"). ones(12, "twelve"). ones(13, "thi...	Give a code snippet in #Prolog Task Show how to spell out a number in English. You can use a preexisting implementation or roll your own, but you should support inputs up to at least one million (or the maximum value of your language's default bounded integer type, if that's less). Support for inputs other than pos...	christopher/rosetta-code
http://rosettacode.org/wiki/Hello_world/Text	Hello world/Text	Hello world/Text is part of Short Circuit's Console Program Basics selection. Task Display the string Hello world! on a text console. Related tasks Hello world/Graphical Hello world/Line Printer Hello world/Newbie Hello world/Newline omission Hello world/Standard error Hello world/Web server	#RASEL	RASEL	A"!dlroW ,olleH">:?@,Hj	Give a code snippet in #RASEL Hello world/Text is part of Short Circuit's Console Program Basics selection. Task Display the string Hello world! on a text console. Related tasks Hello world/Graphical Hello world/Line Printer Hello world/Newbie Hello world/Newline omission Hello world/Standard error ...	christopher/rosetta-code
http://rosettacode.org/wiki/Look-and-say_sequence	Look-and-say sequence	The Look and say sequence is a recursively defined sequence of numbers studied most notably by John Conway. The look-and-say sequence is also known as the Morris Number Sequence, after cryptographer Robert Morris, and the puzzle What is the next number in the sequence 1, 11, 21, 1211, 11122...	#PureBasic	PureBasic	If OpenConsole() Define i, j, cnt, txt$, curr$, result$ Print("Enter start sequence: "): txt$=Input() Print("How many repetitions: "): i=Val(Input()) ; PrintN(#CRLF$+"Sequence:"+#CRLF$+txt$) Repeat j=1 result$="" Repeat curr$=Mid(txt$,j,1) cnt=0 Repeat cnt+1 j+1...	Give a code snippet in #PureBasic The Look and say sequence is a recursively defined sequence of numbers studied most notably by John Conway. The look-and-say sequence is also known as the Morris Number Sequence, after cryptographer Robert Morris, and the puzzle What is the next number in the sequ...	christopher/rosetta-code
http://rosettacode.org/wiki/File_input/output	File input/output	File input/output is part of Short Circuit's Console Program Basics selection. Task Create a file called "output.txt", and place in it the contents of the file "input.txt", via an intermediate variable. In other words, your program will demonstrate: how to read from a file into a variable how to write ...	#Object_Pascal	Object Pascal	uses classes; begin with TFileStream.Create('input.txt', fmOpenRead) do try SaveToFile('output.txt'); finally Free; end; end;	Give a code snippet in #Object_Pascal File input/output is part of Short Circuit's Console Program Basics selection. Task Create a file called "output.txt", and place in it the contents of the file "input.txt", via an intermediate variable. In other words, your program will demonstrate: how to read from ...	christopher/rosetta-code
http://rosettacode.org/wiki/Integer_comparison	Integer comparison	Basic Data Operation This is a basic data operation. It represents a fundamental action on a basic data type. You may see other such operations in the Basic Data Operations category, or: Integer Operations Arithmetic \| Comparison Boolean Operations Bitwise \| Logical String Operations Concatenation \| Interpolation \|...	#AArch64_Assembly	AArch64 Assembly	.equ STDOUT, 1 .equ SVC_WRITE, 64 .equ SVC_EXIT, 93 .text .global _start _start: stp x29, x30, [sp, -16]! mov x0, #123 mov x1, #456 mov x29, sp bl integer_compare // integer_compare(123, 456); mov x0, #-123 mov x1, #-456 bl integer_compare // integer_compare(-123, -456); mov x0, #123 mov x1, #123 bl inte...	Give a code snippet in #AArch64_Assembly Basic Data Operation This is a basic data operation. It represents a fundamental action on a basic data type. You may see other such operations in the Basic Data Operations category, or: Integer Operations Arithmetic \| Comparison Boolean Operations Bitwise \| Logical String ...	christopher/rosetta-code
http://rosettacode.org/wiki/Van_der_Corput_sequence	Van der Corput sequence	When counting integers in binary, if you put a (binary) point to the righEasyLangt of the count then the column immediately to the left denotes a digit with a multiplier of 2 0 {\displaystyle 2^{0}} ; the digit in the next column to the left has a multiplier of 2 1 {\displaystyle 2^{1}} ; and so o...	#Cowgol	Cowgol	include "cowgol.coh"; sub vc(n: uint16, base: uint16): (num: uint16, denom: uint16) is var p: uint16 := 0; var q: uint16 := 1; while n != 0 loop p := p * base + n % base; q := q * base; n := n / base; end loop; num := p; denom := q; while p != 0 loop n...	Give a code snippet in #Cowgol When counting integers in binary, if you put a (binary) point to the righEasyLangt of the count then the column immediately to the left denotes a digit with a multiplier of 2 0 {\displaystyle 2^{0}} ; the digit in the next column to the left has a multiplier of 2 1 {...	christopher/rosetta-code
http://rosettacode.org/wiki/Averages/Arithmetic_mean	Averages/Arithmetic mean	Task[edit] Write a program to find the mean (arithmetic average) of a numeric vector. In case of a zero-length input, since the mean of an empty set of numbers is ill-defined, the program may choose to behave in any way it deems appropriate, though if the programming language has an established convention for conveyin...	#PARI.2FGP	PARI/GP	avg(v)={ if(#v,vecsum(v)/#v) };	Give a code snippet in #PARI.2FGP Task[edit] Write a program to find the mean (arithmetic average) of a numeric vector. In case of a zero-length input, since the mean of an empty set of numbers is ill-defined, the program may choose to behave in any way it deems appropriate, though if the programming language has an ...	christopher/rosetta-code
http://rosettacode.org/wiki/Sorting_algorithms/Bogosort	Sorting algorithms/Bogosort	Sorting Algorithm This is a sorting algorithm. It may be applied to a set of data in order to sort it. For comparing various sorts, see compare sorts. For other sorting algorithms, see sorting algorithms, or: O(n logn) sorts Heap sort \| Merge sort \| Patience sort \| Quick sort O(n log2n) sorts Shell Sort ...	#Ada	Ada	with Ada.Text_IO; use Ada.Text_IO; with Ada.Numerics.Discrete_Random; procedure Test_Bogosort is generic type Ordered is private; type List is array (Positive range <>) of Ordered; with function "<" (L, R : Ordered) return Boolean is <>; procedure Bogosort (Data : in out List); procedure...	Give a code snippet in #Ada Sorting Algorithm This is a sorting algorithm. It may be applied to a set of data in order to sort it. For comparing various sorts, see compare sorts. For other sorting algorithms, see sorting algorithms, or: O(n logn) sorts Heap sort \| Merge sort \| Patience sort \| Quick sort...	christopher/rosetta-code
http://rosettacode.org/wiki/Teacup_rim_text	Teacup rim text	On a set of coasters we have, there's a picture of a teacup. On the rim of the teacup the word TEA appears a number of times separated by bullet characters (•). It occurred to me that if the bullet were removed and the words run together, you could start at any letter and still end up with a meaningful three...	#Python	Python	'''Teacup rim text''' from itertools import chain, groupby from os.path import expanduser from functools import reduce # main :: IO () def main(): '''Circular anagram groups, of more than one word, and containing words of length > 2, found in: https://www.mit.edu/~ecprice/wordlist.10000 ''' ...	Give a code snippet in #Python On a set of coasters we have, there's a picture of a teacup. On the rim of the teacup the word TEA appears a number of times separated by bullet characters (•). It occurred to me that if the bullet were removed and the words run together, you could start at any letter and stil...	christopher/rosetta-code
http://rosettacode.org/wiki/String_length	String length	Task Find the character and byte length of a string. This means encodings like UTF-8 need to be handled properly, as there is not necessarily a one-to-one relationship between bytes and characters. By character, we mean an individual Unicode code point, not a user-visible grapheme containing combining characters. F...	#LabVIEW	LabVIEW	{script LAMBDATALK.DICT["W.unicodeLength"] = function() { function countCodePoints(str) { var point, index, width = 0, len = 0; for (index = 0; index < str.length;) { point = str.codePointAt(index); width = 0; while (point) { width += 1; point =...	Give a code snippet in #LabVIEW Task Find the character and byte length of a string. This means encodings like UTF-8 need to be handled properly, as there is not necessarily a one-to-one relationship between bytes and characters. By character, we mean an individual Unicode code point, not a user-visible grapheme co...	christopher/rosetta-code
http://rosettacode.org/wiki/Mad_Libs	Mad Libs	This page uses content from Wikipedia. The original article was at Mad Libs. The list of authors can be seen in the page history. As with Rosetta Code, the text of Wikipedia is available under the GNU FDL. (See links for details on variance) Mad Libs is a phrasal template word game where one player prompts another...	#Phix	Phix	without js -- file i/o, prompt_string string mlfile = "", -- eg story.txt mltxt = iff(length(mlfile)?join(read_lines(mlfile),"\n"):""" <name> went for a walk in the park. <he or she> found a <noun>. <name> decided to take it home. """) sequence strings = {}, replacements = {} integer startpos, endpos=1 while 1 do ...	Give a code snippet in #Phix This page uses content from Wikipedia. The original article was at Mad Libs. The list of authors can be seen in the page history. As with Rosetta Code, the text of Wikipedia is available under the GNU FDL. (See links for details on variance) Mad Libs is a phrasal template word game wh...	christopher/rosetta-code
http://rosettacode.org/wiki/Binary_search	Binary search	A binary search divides a range of values into halves, and continues to narrow down the field of search until the unknown value is found. It is the classic example of a "divide and conquer" algorithm. As an analogy, consider the children's game "guess a number." The scorer has a secret number, and will only tell the p...	#Eiffel	Eiffel	class APPLICATION create make feature {NONE} -- Initialization make local a: ARRAY [INTEGER] keys: ARRAY [INTEGER] do a := <<0, 1, 4, 5, 6, 7, 8, 9, 12, 26, 45, 67, 78, 90, 98, 123, 211, 234, 456, 769, 865, 2345, 3215, 14345, 24324>> keys := <<0, 42, 45, ...	Give a code snippet in #Eiffel A binary search divides a range of values into halves, and continues to narrow down the field of search until the unknown value is found. It is the classic example of a "divide and conquer" algorithm. As an analogy, consider the children's game "guess a number." The scorer has a secret ...	christopher/rosetta-code
http://rosettacode.org/wiki/Man_or_boy_test	Man or boy test	Man or boy test You are encouraged to solve this task according to the task description, using any language you may know. Background: The man or boy test was proposed by computer scientist Donald Knuth as a means of evaluating implementations of the ALGOL 60 programming language. The aim of the test was to distinguis...	#Scala	Scala	def A(in_k: Int, x1: =>Int, x2: =>Int, x3: =>Int, x4: =>Int, x5: =>Int): Int = { var k = in_k def B: Int = { k = k-1 A(k, B, x1, x2, x3, x4) } if (k<=0) x4+x5 else B } println(A(10, 1, -1, -1, 1, 0))	Give a code snippet in #Scala Man or boy test You are encouraged to solve this task according to the task description, using any language you may know. Background: The man or boy test was proposed by computer scientist Donald Knuth as a means of evaluating implementations of the ALGOL 60 programming language. The ai...	christopher/rosetta-code
http://rosettacode.org/wiki/Least_common_multiple	Least common multiple	Least common multiple You are encouraged to solve this task according to the task description, using any language you may know. Task Compute the least common multiple (LCM) of two integers. Given m and n, the least common multiple is the smallest positive integer that has both m and n as factor...	#PureBasic	PureBasic	Procedure GCDiv(a, b); Euclidean algorithm Protected r While b r = b b = a%b a = r Wend ProcedureReturn a EndProcedure Procedure LCM(m,n) Protected t If m And n t=mn/GCDiv(m,n) EndIf ProcedureReturn tSign(t) EndProcedure	Give a code snippet in #PureBasic Least common multiple You are encouraged to solve this task according to the task description, using any language you may know. Task Compute the least common multiple (LCM) of two integers. Given m and n, the least common multiple is the smallest positive integer that...	christopher/rosetta-code
http://rosettacode.org/wiki/Fibonacci_sequence	Fibonacci sequence	The Fibonacci sequence is a sequence Fn of natural numbers defined recursively: F0 = 0 F1 = 1 Fn = Fn-1 + Fn-2, if n>1 Task Write a function to generate the nth Fibonacci number. Solutions can be iterative or recursive (though recursive solutions are generally considered too slow ...	#Falcon	Falcon	function fib_i(n) if n < 2: return n fibPrev = 1 fib = 1 for i in [2:n] tmp = fib fib += fibPrev fibPrev = tmp end return fib end	Give a code snippet in #Falcon The Fibonacci sequence is a sequence Fn of natural numbers defined recursively: F0 = 0 F1 = 1 Fn = Fn-1 + Fn-2, if n>1 Task Write a function to generate the nth Fibonacci number. Solutions can be iterative or recursive (though recursive solutions ar...	christopher/rosetta-code
http://rosettacode.org/wiki/Square_but_not_cube	Square but not cube	Task Show the first 30 positive integers which are squares but not cubes of such integers. Optionally, show also the first 3 positive integers which are both squares and cubes, and mark them as such.	#Cowgol	Cowgol	include "cowgol.coh"; var cube: uint16 := 1; var ncube: uint16 := 1; var sqr: uint16 := 1; var nsqr: uint16 := 1; var seen: uint8 := 0; while seen < 30 loop sqr := nsqr * nsqr; while sqr > cube loop ncube := ncube + 1; cube := ncube * ncube * ncube; end loop; if sqr != cube then ...	Give a code snippet in #Cowgol Task Show the first 30 positive integers which are squares but not cubes of such integers. Optionally, show also the first 3 positive integers which are both squares and cubes, and mark them as such.	christopher/rosetta-code
http://rosettacode.org/wiki/Loops/For	Loops/For	“For” loops are used to make some block of code be iterated a number of times, setting a variable or parameter to a monotonically increasing integer value for each execution of the block of code. Common extensions of this allow other counting patterns or iterating over abstract structures other than the integers. ...	#Sather	Sather	class MAIN is -- from, to, step for!(once init:INT, once to:INT, once inc:INT):INT is i ::= init; loop while!( i <= to ); yield i; i := i + inc; end; end; main is i, j :INT; loop i := for!(1, 5, 1); -- 1.upto!(5) loop j := for!(1, i, 1); -- 1.upto!(i) #OUT + "*"...	Give a code snippet in #Sather “For” loops are used to make some block of code be iterated a number of times, setting a variable or parameter to a monotonically increasing integer value for each execution of the block of code. Common extensions of this allow other counting patterns or iterating over abstract struct...	christopher/rosetta-code
http://rosettacode.org/wiki/Hello_world/Line_printer	Hello world/Line printer	Task Cause a line printer attached to the computer to print a line containing the message: Hello World! Note A line printer is not the same as standard output. A line printer was an older-style printer which prints one line at a time to a continuous ream of paper. With some systems, a line printer can be...	#X86_Assembly	X86 Assembly	;Assemble with: tasm, tlink /t ;assume direction bit is clear (so si increments) .model tiny .code org 100h start: mov si, offset msg ;point to message jmp pr20 pr10: mov ah, 0 ;write character to printer mov dx, 0 ;LPT1 int ...	Give a code snippet in #X86_Assembly Task Cause a line printer attached to the computer to print a line containing the message: Hello World! Note A line printer is not the same as standard output. A line printer was an older-style printer which prints one line at a time to a continuous ream of paper. Wi...	christopher/rosetta-code
http://rosettacode.org/wiki/Ordered_words	Ordered words	An ordered word is a word in which the letters appear in alphabetic order. Examples include abbey and dirt. Task[edit] Find and display all the ordered words in the dictionary unixdict.txt that have the longest word length. (Examples that access the dictionary file locally assume that you have download...	#PicoLisp	PicoLisp	(in "unixdict.txt" (mapc prinl (maxi '((L) (length (car L))) (by length group (filter '((S) (apply <= S)) (make (while (line) (link @))) ) ) ) ) )	Give a code snippet in #PicoLisp An ordered word is a word in which the letters appear in alphabetic order. Examples include abbey and dirt. Task[edit] Find and display all the ordered words in the dictionary unixdict.txt that have the longest word length. (Examples that access the dictionary file loc...	christopher/rosetta-code
http://rosettacode.org/wiki/Window_creation/X11	Window creation/X11	Task Create a simple X11 application, using an X11 protocol library such as Xlib or XCB, that draws a box and "Hello World" in a window. Implementations of this task should avoid using a toolkit as much as possible.	#Java	Java	javac WindowExample.java	Give a code snippet in #Java Task Create a simple X11 application, using an X11 protocol library such as Xlib or XCB, that draws a box and "Hello World" in a window. Implementations of this task should avoid using a toolkit as much as possible.	christopher/rosetta-code
http://rosettacode.org/wiki/Determine_if_a_string_has_all_the_same_characters	Determine if a string has all the same characters	Task Given a character string (which may be empty, or have a length of zero characters): create a function/procedure/routine to: determine if all the characters in the string are the same indicate if or which character is different from the previous character display each string and its length (as the...	#Ring	Ring	nputStr = [""," ","2","333",".55","tttTTT","4444 444k"] for word in inputStr for x = 1 to len(word) for y = x + 1 to len(word) if word[x] != word[y] char = word[y] ? "Input = " + "'" + word + "'" + ", length = " + len(word) ? " First difference ...	Give a code snippet in #Ring Task Given a character string (which may be empty, or have a length of zero characters): create a function/procedure/routine to: determine if all the characters in the string are the same indicate if or which character is different from the previous character display each s...	christopher/rosetta-code
http://rosettacode.org/wiki/Create_a_file	Create a file	In this task, the job is to create a new empty file called "output.txt" of size 0 bytes and an empty directory called "docs". This should be done twice: once "here", i.e. in the current working directory and once in the filesystem root.	#zkl	zkl	$ ls -l docs ls: cannot access docs: No such file or directory $ zkl zkl: fcn createOutputTxt(dir){ dir=dir+"/docs"; File.mkdir(dir); File(dir+"/output.txt","w") } Void zkl: createOutputTxt(".") File(./docs/output.txt) zkl: createOutputTxt("/") Stack trace for VM#1 ...	Give a code snippet in #zkl In this task, the job is to create a new empty file called "output.txt" of size 0 bytes and an empty directory called "docs". This should be done twice: once "here", i.e. in the current working directory and once in the filesystem root.	christopher/rosetta-code
http://rosettacode.org/wiki/Factorial	Factorial	Definitions The factorial of 0 (zero) is defined as being 1 (unity). The Factorial Function of a positive integer, n, is defined as the product of the sequence: n, n-1, n-2, ... 1 Task Write a function to return the factorial of a number. Solutions can be iterat...	#VHDL	VHDL	LIBRARY ieee; USE ieee.std_logic_1164.ALL; USE ieee.numeric_std.ALL; ENTITY Factorial IS GENERIC ( Nbin : INTEGER := 3 ; -- number of bit to input number Nbou : INTEGER := 13) ; -- number of bit to output factorial PORT ( clk : IN STD_LOGIC ; -- clock of circuit sr : IN STD_LOGIC_VECTOR(1 DOWNTO 0); -...	Give a code snippet in #VHDL Definitions The factorial of 0 (zero) is defined as being 1 (unity). The Factorial Function of a positive integer, n, is defined as the product of the sequence: n, n-1, n-2, ... 1 Task Write a function to return the factorial of a nu...	christopher/rosetta-code
http://rosettacode.org/wiki/Power_set	Power set	A set is a collection (container) of certain values, without any particular order, and no repeated values. It corresponds with a finite set in mathematics. A set can be implemented as an associative array (partial mapping) in which the value of each key-value pair is ignored. Given a set S, the power set (or pow...	#ALGOL_68	ALGOL 68	MODE MEMBER = INT; PROC power set = ([]MEMBER s)[][]MEMBER:( [2**UPB s]FLEX[1:0]MEMBER r; INT upb r := 0; r[upb r +:= 1] := []MEMBER(()); FOR i TO UPB s DO MEMBER e = s[i]; FOR j TO upb r DO [UPB r[j] + 1]MEMBER x; x[:UPB x-1] := r[j]; x[UPB x] := e; # append to the end of x # ...	Give a code snippet in #ALGOL_68 A set is a collection (container) of certain values, without any particular order, and no repeated values. It corresponds with a finite set in mathematics. A set can be implemented as an associative array (partial mapping) in which the value of each key-value pair is ignored. Gi...	christopher/rosetta-code
http://rosettacode.org/wiki/Terminal_control/Preserve_screen	Terminal control/Preserve screen	Task Clear the screen, output something on the display, and then restore the screen to the preserved state that it was in before the task was carried out. There is no requirement to change the font or kerning in this task, however character decorations and attributes are expected to be preserved. If the implement...	#BBC_BASIC	BBC BASIC	PRINT "This is the original screen" OSCLI "GSAVE """ + @tmp$ + "bbcsave""" WAIT 200 CLS PRINT "This is the new screen, following a CLS" WAIT 200 OSCLI "DISPLAY """ + @tmp$ + "bbcsave"""	Give a code snippet in #BBC_BASIC Task Clear the screen, output something on the display, and then restore the screen to the preserved state that it was in before the task was carried out. There is no requirement to change the font or kerning in this task, however character decorations and attributes are expected ...	christopher/rosetta-code
http://rosettacode.org/wiki/Video_display_modes	Video display modes	The task is to demonstrate how to switch video display modes within the language. A brief description of the supported video modes would be useful.	#Python	Python	import win32api import win32con import pywintypes devmode=pywintypes.DEVMODEType() devmode.PelsWidth=640 devmode.PelsHeight=480 devmode.Fields=win32con.DM_PELSWIDTH \| win32con.DM_PELSHEIGHT win32api.ChangeDisplaySettings(devmode,0)	Give a code snippet in #Python The task is to demonstrate how to switch video display modes within the language. A brief description of the supported video modes would be useful.	christopher/rosetta-code
http://rosettacode.org/wiki/SHA-256	SHA-256	SHA-256 is the recommended stronger alternative to SHA-1. See FIPS PUB 180-4 for implementation details. Either by using a dedicated library or implementing the algorithm in your language, show that the SHA-256 digest of the string "Rosetta code" is: 764faf5c61ac315f1497f9dfa542713965b785e5cc2f707d6468d7d1124cdfcf	#Haxe	Haxe	import haxe.crypto.Sha256; class Main { static function main() { var sha256 = Sha256.encode("Rosetta code"); Sys.println(sha256); } }	Give a code snippet in #Haxe SHA-256 is the recommended stronger alternative to SHA-1. See FIPS PUB 180-4 for implementation details. Either by using a dedicated library or implementing the algorithm in your language, show that the SHA-256 digest of the string "Rosetta code" is: 764faf5c61ac315f1497f9dfa542713965b785...	christopher/rosetta-code
http://rosettacode.org/wiki/Calculating_the_value_of_e	Calculating the value of e	Task Calculate the value of e. (e is also known as Euler's number and Napier's constant.) See details: Calculating the value of e	#TI-83_BASIC	TI-83 BASIC	0->D 2->N 2->E 1->F 1.0E-12->Z While abs(E-D)>Z F*N->F N+1->N E->D E+1/F->E End Disp E	Give a code snippet in #TI-83_BASIC Task Calculate the value of e. (e is also known as Euler's number and Napier's constant.) See details: Calculating the value of e	christopher/rosetta-code
http://rosettacode.org/wiki/Anagrams/Deranged_anagrams	Anagrams/Deranged anagrams	Two or more words are said to be anagrams if they have the same characters, but in a different order. By analogy with derangements we define a deranged anagram as two words with the same characters, but in which the same character does not appear in the same position in both words. Task[edit] Use the word list at uni...	#OCaml	OCaml	let sort_chars s = let r = String.copy s in for i = 0 to (String.length r) - 2 do for j = i + 1 to (String.length r) - 1 do if r.[i] > r.[j] then begin let tmp = r.[i] in r.[i] <- r.[j]; r.[j] <- tmp; end done done; (r) let deranged (s1, s2) = let len1 = String.le...	Give a code snippet in #OCaml Two or more words are said to be anagrams if they have the same characters, but in a different order. By analogy with derangements we define a deranged anagram as two words with the same characters, but in which the same character does not appear in the same position in both words. Task...	christopher/rosetta-code
http://rosettacode.org/wiki/Fusc_sequence	Fusc sequence	Definitions The fusc integer sequence is defined as: fusc(0) = 0 fusc(1) = 1 for n>1, the nth term is defined as: if n is even; fusc(n) = fusc(n/2) if n is odd; fusc(n) = fusc((n-1)/2) + fusc((n+1)/2) Note that MathWorld's definition starts with unity, not zero. Th...	#Visual_Basic_.NET	Visual Basic .NET	Module Module1 Dim n As Integer = 61, l As List(Of Integer) = {0, 1}.ToList Function fusc(n As Integer) As Integer If n < l.Count Then Return l(n) fusc = If((n And 1) = 0, l(n >> 1), l((n - 1) >> 1) + l((n + 1) >> 1)) l.Add(fusc) End Function Sub Main(args As String()) ...	Give a code snippet in #Visual_Basic_.NET Definitions The fusc integer sequence is defined as: fusc(0) = 0 fusc(1) = 1 for n>1, the nth term is defined as: if n is even; fusc(n) = fusc(n/2) if n is odd; fusc(n) = fusc((n-1)/2) + fusc((n+1)/2) Note that MathWorld's d...	christopher/rosetta-code
http://rosettacode.org/wiki/Determine_if_a_string_is_numeric	Determine if a string is numeric	Task Create a boolean function which takes in a string and tells whether it is a numeric string (floating point and negative numbers included) in the syntax the language uses for numeric literals or numbers converted from strings. Other tasks related to string operations: Metrics Array length String length Cop...	#Euphoria	Euphoria	include get.e function is_numeric(sequence s) sequence val val = value(s) return val[1]=GET_SUCCESS and atom(val[2]) end function	Give a code snippet in #Euphoria Task Create a boolean function which takes in a string and tells whether it is a numeric string (floating point and negative numbers included) in the syntax the language uses for numeric literals or numbers converted from strings. Other tasks related to string operations: Metrics...	christopher/rosetta-code
http://rosettacode.org/wiki/Command-line_arguments	Command-line arguments	Command-line arguments is part of Short Circuit's Console Program Basics selection. Scripted main See also Program name. For parsing command line arguments intelligently, see Parsing command-line arguments. Example command line: myprogram -c "alpha beta" -h "gamma"	#CLU	CLU	% This program needs to be merged with PCLU's "useful.lib", % where get_argv lives. % % pclu -merge $CLUHOME/lib/useful.lib -compile cmdline.clu start_up = proc () po: stream := stream$primary_output() args: sequence[string] := get_argv() for arg: string in sequence[string]$elements(args) do s...	Give a code snippet in #CLU Command-line arguments is part of Short Circuit's Console Program Basics selection. Scripted main See also Program name. For parsing command line arguments intelligently, see Parsing command-line arguments. Example command line: myprogram -c "alpha beta" -h "gamma"	christopher/rosetta-code
http://rosettacode.org/wiki/Find_limit_of_recursion	Find limit of recursion	Find limit of recursion is part of Short Circuit's Console Program Basics selection. Task Find the limit of recursion.	#VBScript	VBScript	'mung.vbs option explicit dim c if wscript.arguments.count = 1 then c = wscript.arguments(0) c = c + 1 else c = 0 end if wscript.echo "[Depth",c & "] Mung until no good." CreateObject("WScript.Shell").Run "cscript Mung.vbs " & c, 1, true wscript.echo "[Depth",c & "] no good."	Give a code snippet in #VBScript Find limit of recursion is part of Short Circuit's Console Program Basics selection. Task Find the limit of recursion.	christopher/rosetta-code
http://rosettacode.org/wiki/Odd_word_problem	Odd word problem	Task Write a program that solves the odd word problem with the restrictions given below. Description You are promised an input stream consisting of English letters and punctuations. It is guaranteed that: the words (sequence of consecutive letters) are delimited by one and only one punctuation, the stream will...	#Sidef	Sidef	func rev { (var c = STDIN.getc) \\ return() if (c ~~ /^[a-z]\z/i) { var r = rev() print c return r } return c } var (n=0, l=false) while (defined(var c = STDIN.getc)) { var w = (c ~~ /^[a-z]\z/i) ++n if (w && !l) l = w if (n & 1) { print c } else { ...	Give a code snippet in #Sidef Task Write a program that solves the odd word problem with the restrictions given below. Description You are promised an input stream consisting of English letters and punctuations. It is guaranteed that: the words (sequence of consecutive letters) are delimited by one and only on...	christopher/rosetta-code
http://rosettacode.org/wiki/Extensible_prime_generator	Extensible prime generator	Task Write a generator of prime numbers, in order, that will automatically adjust to accommodate the generation of any reasonably high prime. The routine should demonstrably rely on either: Being based on an open-ended counter set to count without upper limit other than system or programming language limits. In thi...	#PureBasic	PureBasic	EnableExplicit DisableDebugger Define StartTime.i=ElapsedMilliseconds() Procedure.b IsPrime(n.i) Define i.i=5 If n<2 : ProcedureReturn #False : EndIf If n%2=0 : ProcedureReturn Bool(n=2) : EndIf If n%3=0 : ProcedureReturn Bool(n=3) : EndIf While i*i<=n If n%i=0 : ProcedureReturn #False : EndIf i+2 ...	Give a code snippet in #PureBasic Task Write a generator of prime numbers, in order, that will automatically adjust to accommodate the generation of any reasonably high prime. The routine should demonstrably rely on either: Being based on an open-ended counter set to count without upper limit other than system or ...	christopher/rosetta-code
http://rosettacode.org/wiki/Long_literals,_with_continuations	Long literals, with continuations	This task is about writing a computer program that has long literals (character literals that may require specifying the words/tokens on more than one (source) line, either with continuations or some other method, such as abutments or concatenations (or some other mechanisms). The literal is to be in the form ...	#Pascal	Pascal	#!/usr/bin/perl use strict; # https://rosettacode.org/wiki/Long_literals,_with_continuations use warnings; my $longliteral = join ' ', split ' ', <<END; hydrogen helium lithium beryllium boron carbon nitrogen oxygen fluorine neon sodium magnesium aluminum silicon phosphorous sulfur chlorine argon potassium calcium ...	Give a code snippet in #Pascal This task is about writing a computer program that has long literals (character literals that may require specifying the words/tokens on more than one (source) line, either with continuations or some other method, such as abutments or concatenations (or some other mechanisms). T...	christopher/rosetta-code
http://rosettacode.org/wiki/Find_the_intersection_of_a_line_with_a_plane	Find the intersection of a line with a plane	Finding the intersection of an infinite ray with a plane in 3D is an important topic in collision detection. Task Find the point of intersection for the infinite ray with direction (0, -1, -1) passing through position (0, 0, 10) with the infinite plane with a normal vector of (0, 0, 1) and which passes ...	#Groovy	Groovy	class LinePlaneIntersection { private static class Vector3D { private double x, y, z Vector3D(double x, double y, double z) { this.x = x this.y = y this.z = z } Vector3D plus(Vector3D v) { return new Vector3D(x + v.x, y + v.y, z + v...	Give a code snippet in #Groovy Finding the intersection of an infinite ray with a plane in 3D is an important topic in collision detection. Task Find the point of intersection for the infinite ray with direction (0, -1, -1) passing through position (0, 0, 10) with the infinite plane with a normal vector of...	christopher/rosetta-code
http://rosettacode.org/wiki/Iterated_digits_squaring	Iterated digits squaring	If you add the square of the digits of a Natural number (an integer bigger than zero), you always end with either 1 or 89: 15 -> 26 -> 40 -> 16 -> 37 -> 58 -> 89 7 -> 49 -> 97 -> 130 -> 10 -> 1 An example in Python: >>> step = lambda x: sum(int(d) ** 2 for d in str(x)) >>> iterate = lambda x: x if x in [1, 89] else i...	#C.23	C#	using System; public static class IteratedDigitsSquaring { public static void Main() { Console.WriteLine(Count89s(1_000_000)); Console.WriteLine(Count89s(100_000_000)); } public static int Count89s(int limit) { if (limit < 1) return 0; int[] end = new int[Math.Min(limit, 9 ...	Give a code snippet in #C.23 If you add the square of the digits of a Natural number (an integer bigger than zero), you always end with either 1 or 89: 15 -> 26 -> 40 -> 16 -> 37 -> 58 -> 89 7 -> 49 -> 97 -> 130 -> 10 -> 1 An example in Python: >>> step = lambda x: sum(int(d) ** 2 for d in str(x)) >>> iterate = lamb...	christopher/rosetta-code
http://rosettacode.org/wiki/Koch_curve	Koch curve	Draw a Koch curve. See details: Koch curve	#Nim	Nim	from math import sin, cos, PI import libgd const width = 512 height = 512 iterations = 4 proc kochCurve(img: gdImagePtr, x1, y1, x2, y2: float, iter: int): void = let angle = PI / 3 # 60 degrees let x3 = (x1 * 2 + x2) / 3 let y3 = (y1 * 2 + y2) / 3 let x4 = (x1 + x2 * 2) / 3 let y4 = (y1 + y2 * 2...	Give a code snippet in #Nim Draw a Koch curve. See details: Koch curve	christopher/rosetta-code
http://rosettacode.org/wiki/24_game	24 game	The 24 Game tests one's mental arithmetic. Task Write a program that randomly chooses and displays four digits, each from 1 ──► 9 (inclusive) with repetitions allowed. The program should prompt for the player to enter an arithmetic expression using just those, and all of those four digits, used exactly once each. T...	#Picat	Picat	import util. main => play. play => nl, Digits = [random() mod 9 + 1 : _ in 1..4].sort(), println("Enter \"q\" to quit"), println("Enter \"!\" to request a new set of four digits."), printf("Or enter expression using %w => ", Digits), Exp = read_line().strip(), evaluate(Digits,Exp). ...	Give a code snippet in #Picat The 24 Game tests one's mental arithmetic. Task Write a program that randomly chooses and displays four digits, each from 1 ──► 9 (inclusive) with repetitions allowed. The program should prompt for the player to enter an arithmetic expression using just those, and all of those four di...	christopher/rosetta-code
http://rosettacode.org/wiki/Factorial	Factorial	Definitions The factorial of 0 (zero) is defined as being 1 (unity). The Factorial Function of a positive integer, n, is defined as the product of the sequence: n, n-1, n-2, ... 1 Task Write a function to return the factorial of a number. Solutions can be iterat...	#.D0.9C.D0.9A-61.2F52	МК-61/52	ВП П0 1 ИП0 * L0 03 С/П	Give a code snippet in #.D0.9C.D0.9A-61.2F52 Definitions The factorial of 0 (zero) is defined as being 1 (unity). The Factorial Function of a positive integer, n, is defined as the product of the sequence: n, n-1, n-2, ... 1 Task Write a function to return the f...	christopher/rosetta-code
http://rosettacode.org/wiki/Higher-order_functions	Higher-order functions	Task Pass a function as an argument to another function. Related task First-class functions	#Oforth	Oforth	[1, 2, 3, 4, 5 ] map(#1+)	Give a code snippet in #Oforth Task Pass a function as an argument to another function. Related task First-class functions	christopher/rosetta-code
http://rosettacode.org/wiki/Copy_a_string	Copy a string	This task is about copying a string. Task Where it is relevant, distinguish between copying the contents of a string versus making an additional reference to an existing string. Other tasks related to string operations: Metrics Array length String length Copy a string Empty string (assignment) Counting W...	#Batch_File	Batch File	set src=Hello set dst=%src%	Give a code snippet in #Batch_File This task is about copying a string. Task Where it is relevant, distinguish between copying the contents of a string versus making an additional reference to an existing string. Other tasks related to string operations: Metrics Array length String length Copy a string Em...	christopher/rosetta-code
http://rosettacode.org/wiki/Averages/Root_mean_square	Averages/Root mean square	Task[edit] Compute the Root mean square of the numbers 1..10. The root mean square is also known by its initials RMS (or rms), and as the quadratic mean. The RMS is calculated as the mean of the squares of the numbers, square-rooted: x r m s = x 1 2 + x 2 2 + ⋯ + x ...	#Ada	Ada	with Ada.Float_Text_IO; use Ada.Float_Text_IO; with Ada.Numerics.Elementary_Functions; use Ada.Numerics.Elementary_Functions; procedure calcrms is type float_arr is array(1..10) of Float; function rms(nums : float_arr) return Float is sum : Float := 0.0; begin for p in nums'Range loop sum := sum + nums(p)*...	Give a code snippet in #Ada Task[edit] Compute the Root mean square of the numbers 1..10. The root mean square is also known by its initials RMS (or rms), and as the quadratic mean. The RMS is calculated as the mean of the squares of the numbers, square-rooted: x r m s = x 1 2 +...	christopher/rosetta-code
http://rosettacode.org/wiki/99_bottles_of_beer	99 bottles of beer	Task Display the complete lyrics for the song: 99 Bottles of Beer on the Wall. The beer song The lyrics follow this form: 99 bottles of beer on the wall 99 bottles of beer Take one down, pass it around 98 bottles of beer on the wall 98 bottles of beer on the wall 98 bottles of beer Take one dow...	#IDL	IDL	Pro bottles for i=1,99 do begin print, 100-i, " bottles of beer on the wall.", 100-i, $ " bottles of beer.", " Take one down, pass it around," , $ 99-i, " bottles of beer on the wall." endfor End	Give a code snippet in #IDL Task Display the complete lyrics for the song: 99 Bottles of Beer on the Wall. The beer song The lyrics follow this form: 99 bottles of beer on the wall 99 bottles of beer Take one down, pass it around 98 bottles of beer on the wall 98 bottles of beer on the wall 98 b...	christopher/rosetta-code
http://rosettacode.org/wiki/Box_the_compass	Box the compass	There be many a land lubber that knows naught of the pirate ways and gives direction by degree! They know not how to box the compass! Task description Create a function that takes a heading in degrees and returns the correct 32-point compass heading. Use the function to print and display a table of Index, Compass...	#PowerShell	PowerShell	function Convert-DegreeToDirection ( [double]$Degree ) { $Directions = @( 'n','n by e','n-ne','ne by n','ne','ne by e','e-ne','e by n', 'e','e by s','e-se','se by e','se','se by s','s-se','s by e', 's','s by w','s-sw','sw by s','sw','sw by w','w-sw','w by s',...	Give a code snippet in #PowerShell There be many a land lubber that knows naught of the pirate ways and gives direction by degree! They know not how to box the compass! Task description Create a function that takes a heading in degrees and returns the correct 32-point compass heading. Use the function to print a...	christopher/rosetta-code
http://rosettacode.org/wiki/Babbage_problem	Babbage problem	Charles Babbage, looking ahead to the sorts of problems his Analytical Engine would be able to solve, gave this example: What is the smallest positive integer whose square ends in the digits 269,696? — Babbage, letter to Lord Bowden, 1837; see Hollingdale and Tootill, Electronic Computers, second edition, 1970, p....	#FreeBASIC	FreeBASIC	' version 25-10-2016 ' compile with: fbc -s console ' Charles Babbage would have known that only number ending ' on a 4 or 6 could produce a square ending on a 6 ' also any number below 520 would produce a square smaller than 269,696 ' we can stop when we have reached 99,736 ' we know it square and it ends on 269,696...	Give a code snippet in #FreeBASIC Charles Babbage, looking ahead to the sorts of problems his Analytical Engine would be able to solve, gave this example: What is the smallest positive integer whose square ends in the digits 269,696? — Babbage, letter to Lord Bowden, 1837; see Hollingdale and Tootill, Electronic ...	christopher/rosetta-code
http://rosettacode.org/wiki/Greatest_element_of_a_list	Greatest element of a list	Task Create a function that returns the maximum value in a provided set of values, where the number of values may not be known until run-time.	#RapidQ	RapidQ	functioni FindMax(...) as double dim x as integer for x = 1 to ParamValCount IF ParamVal(x) > Result THEN Result = ParamVal(x) next End functioni Print FindMax(50, 20, 65, 20, 105)	Give a code snippet in #RapidQ Task Create a function that returns the maximum value in a provided set of values, where the number of values may not be known until run-time.	christopher/rosetta-code
http://rosettacode.org/wiki/Function_composition	Function composition	Task Create a function, compose, whose two arguments f and g, are both functions with one argument. The result of compose is to be a function of one argument, (lets call the argument x), which works like applying function f to the result of applying function g to x. Example compose...	#Raku	Raku	sub triple($n) { 3 * $n } my &f = &triple ∘ &prefix:<-> ∘ { $^n + 2 }; say &f(5); # prints "-21".	Give a code snippet in #Raku Task Create a function, compose, whose two arguments f and g, are both functions with one argument. The result of compose is to be a function of one argument, (lets call the argument x), which works like applying function f to the result of applying function g ...	christopher/rosetta-code
http://rosettacode.org/wiki/Return_multiple_values	Return multiple values	Task Show how to return more than one value from a function.	#Standard_ML	Standard ML	fun addsub (x, y) = (x + y, x - y)	Give a code snippet in #Standard_ML Task Show how to return more than one value from a function.	christopher/rosetta-code
http://rosettacode.org/wiki/Pangram_checker	Pangram checker	Pangram checker You are encouraged to solve this task according to the task description, using any language you may know. A pangram is a sentence that contains all the letters of the English alphabet at least once. For example: The quick brown fox jumps over the lazy dog. Task Write a function or method to chec...	#Excel	Excel	ISPANGRAM =LAMBDA(s, LET( abc, CHARS(LOWER("abcdefghijklmnopqrstuvwxyz")), AND( LAMBDA(c, ISNUMBER(SEARCH(c, s, 1)) )( abc ) ) ) )	Give a code snippet in #Excel Pangram checker You are encouraged to solve this task according to the task description, using any language you may know. A pangram is a sentence that contains all the letters of the English alphabet at least once. For example: The quick brown fox jumps over the lazy dog. Task Wri...	christopher/rosetta-code
http://rosettacode.org/wiki/Delete_a_file	Delete a file	Task Delete a file called "input.txt" and delete a directory called "docs". This should be done twice: once "here", i.e. in the current working directory and once in the filesystem root.	#Pike	Pike	int main(){ rm("input.txt"); rm("/input.txt"); rm("docs"); rm("/docs"); }	Give a code snippet in #Pike Task Delete a file called "input.txt" and delete a directory called "docs". This should be done twice: once "here", i.e. in the current working directory and once in the filesystem root.	christopher/rosetta-code
http://rosettacode.org/wiki/Hello_world/Line_printer	Hello world/Line printer	Task Cause a line printer attached to the computer to print a line containing the message: Hello World! Note A line printer is not the same as standard output. A line printer was an older-style printer which prints one line at a time to a continuous ream of paper. With some systems, a line printer can be...	#Swift	Swift	import Foundation let out = NSOutputStream(toFileAtPath: "/dev/lp0", append: true) let data = "Hello, World!".dataUsingEncoding(NSUTF8StringEncoding, allowLossyConversion: false) out?.open() out?.write(UnsafePointer<UInt8>(data!.bytes), maxLength: data!.length) out?.close()	Give a code snippet in #Swift Task Cause a line printer attached to the computer to print a line containing the message: Hello World! Note A line printer is not the same as standard output. A line printer was an older-style printer which prints one line at a time to a continuous ream of paper. With some...	christopher/rosetta-code
http://rosettacode.org/wiki/ABC_problem	ABC problem	ABC problem You are encouraged to solve this task according to the task description, using any language you may know. You are given a collection of ABC blocks (maybe like the ones you had when you were a kid). There are twenty blocks with two letters on each block. A complete alphabet is guaranteed amongst all sid...	#Gambas	Gambas	Public Sub Main() Dim sCheck As String[] = ["A", "BARK", "BOOK", "TREAT", "COMMON", "SQUAD", "CONFUSE"] Dim sBlock As String[] = ["BO", "XK", "DQ", "CP", "NA", "GT", "RE", "TG", "QD", "FS", "JW", "HU", "VI", "AN", "OB", "ER", "FS", "LY", "PC", "ZM"] Dim sList As New String[] Dim siCount, siLoop As Short Dim sTemp, sAns...	Give a code snippet in #Gambas ABC problem You are encouraged to solve this task according to the task description, using any language you may know. You are given a collection of ABC blocks (maybe like the ones you had when you were a kid). There are twenty blocks with two letters on each block. A complete alphab...	christopher/rosetta-code
http://rosettacode.org/wiki/Run-length_encoding	Run-length encoding	Run-length encoding You are encouraged to solve this task according to the task description, using any language you may know. Task Given a string containing uppercase characters (A-Z), compress repeated 'runs' of the same character by storing the length of that run, and provide a function to reverse the compression...	#AWK	AWK	BEGIN { FS="" } /^[^0-9]+$/ { cp = $1; j = 0 for(i=1; i <= NF; i++) { if ( $i == cp ) { j++; } else { printf("%d%c", j, cp) j = 1 } cp = $i } printf("%d%c", j, cp) }	Give a code snippet in #AWK Run-length encoding You are encouraged to solve this task according to the task description, using any language you may know. Task Given a string containing uppercase characters (A-Z), compress repeated 'runs' of the same character by storing the length of that run, and provide a functi...	christopher/rosetta-code
http://rosettacode.org/wiki/Extreme_floating_point_values	Extreme floating point values	The IEEE floating point specification defines certain 'extreme' floating point values such as minus zero, -0.0, a value distinct from plus zero; not a number, NaN; and plus and minus infinity. The task is to use expressions involving other 'normal' floating point values in your language to calculate these, (and maybe ...	#jq	jq	0/0 #=> null 1e1000 #=> 1.7976931348623157e+308	Give a code snippet in #jq The IEEE floating point specification defines certain 'extreme' floating point values such as minus zero, -0.0, a value distinct from plus zero; not a number, NaN; and plus and minus infinity. The task is to use expressions involving other 'normal' floating point values in your language to ...	christopher/rosetta-code
http://rosettacode.org/wiki/Digital_root	Digital root	The digital root, X {\displaystyle X} , of a number, n {\displaystyle n} , is calculated: find X {\displaystyle X} as the sum of the digits of n {\displaystyle n} find a new X {\displaystyle X} by summing the digits of X {\displaystyle X} , repeating until X {\displ...	#ZX_Spectrum_Basic	ZX Spectrum Basic	10 DATA 4,627615,39390,588225,9992 20 READ j: LET b=10 30 FOR i=1 TO j 40 READ n 50 PRINT "Digital root of ";n;" is" 60 GO SUB 1000 70 NEXT i 80 STOP 1000 REM Digital Root 1010 LET c=0 1020 IF n>=b THEN LET c=c+1: GO SUB 2000: GO TO 1020 1030 PRINT n;" persistance is ";c'' 1040 RETURN 2000 REM Digit sum 2010 LET s=0 ...	Give a code snippet in #ZX_Spectrum_Basic The digital root, X {\displaystyle X} , of a number, n {\displaystyle n} , is calculated: find X {\displaystyle X} as the sum of the digits of n {\displaystyle n} find a new X {\displaystyle X} by summing the digits of X {\display...	christopher/rosetta-code
http://rosettacode.org/wiki/Dijkstra%27s_algorithm	Dijkstra's algorithm	This task has been clarified. Its programming examples are in need of review to ensure that they still fit the requirements of the task. Dijkstra's algorithm, conceived by Dutch computer scientist Edsger Dijkstra in 1956 and published in 1959, is a graph search algorithm that solves the single-source shortest path pro...	#SAS	SAS	/* create SAS data set / data Edges; input Start $ End $ Cost; datalines; a b 7 a c 9 a f 14 b c 10 b d 15 c d 11 c f 2 d e 6 e f 9 ; / call OPTMODEL procedure in SAS/OR / proc optmodel; / declare sets and parameters, and read input data */ set <str,str> LINKS; ...	Give a code snippet in #SAS This task has been clarified. Its programming examples are in need of review to ensure that they still fit the requirements of the task. Dijkstra's algorithm, conceived by Dutch computer scientist Edsger Dijkstra in 1956 and published in 1959, is a graph search algorithm that solves the si...	christopher/rosetta-code
http://rosettacode.org/wiki/Hello_world/Newline_omission	Hello world/Newline omission	Some languages automatically insert a newline after outputting a string, unless measures are taken to prevent its output. Task Display the string Goodbye, World! without a trailing newline. Related tasks Hello world/Graphical Hello world/Line Printer Hello world/Standard error Hello world/Text	#REXX	REXX	/REXX pgm displays a "Goodbye, World!" without a trailing newline. / call charout ,'Goodbye, World!'	Give a code snippet in #REXX Some languages automatically insert a newline after outputting a string, unless measures are taken to prevent its output. Task Display the string Goodbye, World! without a trailing newline. Related tasks Hello world/Graphical Hello world/Line Printer Hello world/Standa...	christopher/rosetta-code
http://rosettacode.org/wiki/Multi-dimensional_array	Multi-dimensional array	For the purposes of this task, the actual memory layout or access method of this data structure is not mandated. It is enough to: State the number and extent of each index to the array. Provide specific, ordered, integer indices for all dimensions of the array together with a new value to update the indexed value. ...	#Klingphix	Klingphix	include ..\Utilitys.tlhy 0 ( 4 3 2 ) dim pstack 5432 ( 4 3 2 ) set pstack ( 4 3 2 ) get ? ( 4 3 ) get %row !row $row ? $row 1 2 set !row $row ? $row ( 4 3 ) set 0 4 repeat ( 4 2 ) set pstack "End " input	Give a code snippet in #Klingphix For the purposes of this task, the actual memory layout or access method of this data structure is not mandated. It is enough to: State the number and extent of each index to the array. Provide specific, ordered, integer indices for all dimensions of the array together with a new ...	christopher/rosetta-code
http://rosettacode.org/wiki/Deconvolution/1D	Deconvolution/1D	The convolution of two functions F {\displaystyle {\mathit {F}}} and H {\displaystyle {\mathit {H}}} of an integer variable is defined as the function G {\displaystyle {\mathit {G}}} satisfying G ( n ) = ∑ m = − ∞ ∞ F ( m ) H ( n − m ) {\displaystyle G(n)=\sum _{m=-\inft...	#BBC_BASIC	BBC BASIC	*FLOAT 64 DIM h(5), f(15), g(20) h() = -8,-9,-3,-1,-6,7 f() = -3,-6,-1,8,-6,3,-1,-9,-9,3,-2,5,2,-2,-7,-1 g() = 24,75,71,-34,3,22,-45,23,245,25,52,25,-67,-96,96,31,55,36,29,-43,-7 PROCdeconv(g(), f(), x()) PRINT "deconv(g,f) = " FNprintarray(x()) x() -= h() : IF SUM(x())...	Give a code snippet in #BBC_BASIC The convolution of two functions F {\displaystyle {\mathit {F}}} and H {\displaystyle {\mathit {H}}} of an integer variable is defined as the function G {\displaystyle {\mathit {G}}} satisfying G ( n ) = ∑ m = − ∞ ∞ F ( m ) H ( n − m ) ...	christopher/rosetta-code
http://rosettacode.org/wiki/Y_combinator	Y combinator	In strict functional programming and the lambda calculus, functions (lambda expressions) don't have state and are only allowed to refer to arguments of enclosing functions. This rules out the usual definition of a recursive function wherein a function is associated with the state of a variable and this variable's stat...	#Wren	Wren	var y = Fn.new { \|f\| var g = Fn.new { \|r\| f.call { \|x\| r.call(r).call(x) } } return g.call(g) } var almostFac = Fn.new { \|f\| Fn.new { \|x\| x <= 1 ? 1 : x * f.call(x-1) } } var almostFib = Fn.new { \|f\| Fn.new { \|x\| x <= 2 ? 1 : f.call(x-1) + f.call(x-2) } } var fac = y.call(almostFac) var fib = y.call(almos...	Give a code snippet in #Wren In strict functional programming and the lambda calculus, functions (lambda expressions) don't have state and are only allowed to refer to arguments of enclosing functions. This rules out the usual definition of a recursive function wherein a function is associated with the state of a var...	christopher/rosetta-code
http://rosettacode.org/wiki/MD5	MD5	Task Encode a string using an MD5 algorithm. The algorithm can be found on Wikipedia. Optionally, validate your implementation by running all of the test values in IETF RFC (1321) for MD5. Additionally, RFC 1321 provides more precise information on the algorithm than the Wikipedia article. Warning:...	#J	J	require 'convert/misc/md5' md5 'The quick brown fox jumped over the lazy dog''s back' e38ca1d920c4b8b8d3946b2c72f01680	Give a code snippet in #J Task Encode a string using an MD5 algorithm. The algorithm can be found on Wikipedia. Optionally, validate your implementation by running all of the test values in IETF RFC (1321) for MD5. Additionally, RFC 1321 provides more precise information on the algorithm than the Wiki...	christopher/rosetta-code
http://rosettacode.org/wiki/CRC-32	CRC-32	Task Demonstrate a method of deriving the Cyclic Redundancy Check from within the language. The result should be in accordance with ISO 3309, ITU-T V.42, Gzip and PNG. Algorithms are described on Computation of CRC in Wikipedia. This variant of CRC-32 uses LSB-first order, sets the initial CRC to FFFFFFFF16, and...	#Java	Java	import java.util.zip.* ; public class CRCMaker { public static void main( String[ ] args ) { String toBeEncoded = new String( "The quick brown fox jumps over the lazy dog" ) ; CRC32 myCRC = new CRC32( ) ; myCRC.update( toBeEncoded.getBytes( ) ) ; System.out.println( "The CRC-32 value is : "...	Give a code snippet in #Java Task Demonstrate a method of deriving the Cyclic Redundancy Check from within the language. The result should be in accordance with ISO 3309, ITU-T V.42, Gzip and PNG. Algorithms are described on Computation of CRC in Wikipedia. This variant of CRC-32 uses LSB-first order, sets the ...	christopher/rosetta-code
http://rosettacode.org/wiki/Pascal%27s_triangle	Pascal's triangle	Pascal's triangle is an arithmetic and geometric figure often associated with the name of Blaise Pascal, but also studied centuries earlier in India, Persia, China and elsewhere. Its first few rows look like this: 1 1 1 1 2 1 1 3 3 1 where each element of each row is either 1 or the sum of the two elemen...	#Lua	Lua	function nextrow(t) local ret = {} t[0], t[#t+1] = 0, 0 for i = 1, #t do ret[i] = t[i-1] + t[i] end return ret end function triangle(n) t = {1} for i = 1, n do print(unpack(t)) t = nextrow(t) end end	Give a code snippet in #Lua Pascal's triangle is an arithmetic and geometric figure often associated with the name of Blaise Pascal, but also studied centuries earlier in India, Persia, China and elsewhere. Its first few rows look like this: 1 1 1 1 2 1 1 3 3 1 where each element of each row is either 1...	christopher/rosetta-code
http://rosettacode.org/wiki/Zero_to_the_zero_power	Zero to the zero power	Some computer programming languages are not exactly consistent (with other computer programming languages) when raising zero to the zeroth power: 00 Task Show the results of raising zero to the zeroth power. If your computer language objects to 0**0 or 0^0 at compile time, ...	#Nim	Nim	import math echo pow(0.0, 0.0) # Floating point exponentiation. echo 0 ^ 0 # Integer exponentiation.	Give a code snippet in #Nim Some computer programming languages are not exactly consistent (with other computer programming languages) when raising zero to the zeroth power: 00 Task Show the results of raising zero to the zeroth power. If your computer language objects to 0**0 or ...	christopher/rosetta-code
http://rosettacode.org/wiki/Permutations/Derangements	Permutations/Derangements	A derangement is a permutation of the order of distinct items in which no item appears in its original place. For example, the only two derangements of the three items (0, 1, 2) are (1, 2, 0), and (2, 0, 1). The number of derangements of n distinct items is known as the subfactorial of n, sometimes written as !n. The...	#PicoLisp	PicoLisp	(load "@lib/simul.l") # For 'permute' (de derangements (Lst) (filter '((L) (not (find = L Lst))) (permute Lst) ) ) (de subfact (N) (if (>= 2 N) (if (= 1 N) 0 1) (* (dec N) (+ (subfact (dec N)) (subfact (- N 2))) ) ) )	Give a code snippet in #PicoLisp A derangement is a permutation of the order of distinct items in which no item appears in its original place. For example, the only two derangements of the three items (0, 1, 2) are (1, 2, 0), and (2, 0, 1). The number of derangements of n distinct items is known as the subfactorial ...	christopher/rosetta-code
http://rosettacode.org/wiki/Identity_matrix	Identity matrix	Task Build an identity matrix of a size known at run-time. An identity matrix is a square matrix of size n × n, where the diagonal elements are all 1s (ones), and all the other elements are all 0s (zeroes). I n = [ 1 0 0 ⋯ 0 0 1 0 ⋯ 0 0 0 1 ⋯ 0 ⋮ ⋮ ⋮ ⋱ ...	#Frink	Frink	n = parseInt[input["Enter matrix dimension as an integer: "]] println[formatMatrix[makeArray[[n, n], {\|a,b\| a==b ? 1 : 0}]]]	Give a code snippet in #Frink Task Build an identity matrix of a size known at run-time. An identity matrix is a square matrix of size n × n, where the diagonal elements are all 1s (ones), and all the other elements are all 0s (zeroes). I n = [ 1 0 0 ⋯ 0 0 1 0 ⋯ 0 0 0...	christopher/rosetta-code
http://rosettacode.org/wiki/Currying	Currying	This page uses content from Wikipedia. The original article was at Currying. The list of authors can be seen in the page history. As with Rosetta Code, the text of Wikipedia is available under the GNU FDL. (See links for details on variance) Task Create a simple demonstrative example of Currying in a specific la...	#Vala	Vala	delegate double Dbl_Op(double d); Dbl_Op curried_add(double a) { return (b) => a + b; } void main() { print(@"$(curried_add(3.0)(4.0))\n"); double sum2 = curried_add(2.0) (curried_add(3.0)(4.0)); //sum2 = 9 print(@"$sum2\n"); }	Give a code snippet in #Vala This page uses content from Wikipedia. The original article was at Currying. The list of authors can be seen in the page history. As with Rosetta Code, the text of Wikipedia is available under the GNU FDL. (See links for details on variance) Task Create a simple demonstrative exampl...	christopher/rosetta-code
http://rosettacode.org/wiki/Exponentiation_operator	Exponentiation operator	Most programming languages have a built-in implementation of exponentiation. Task Re-implement integer exponentiation for both intint and floatint as both a procedure, and an operator (if your language supports operator definition). If the language supports operator (or procedure) overloading, then an ov...	#Erlang	Erlang	pow(X, Y) when Y < 0 -> 1/pow(X, -Y); pow(X, Y) when is_integer(Y) -> pow(X, Y, 1). pow(_, 0, B) -> B; pow(X, Y, B) -> B2 = if Y rem 2 =:= 0 -> B; true -> X * B end, pow(X * X, Y div 2, B2).	Give a code snippet in #Erlang Most programming languages have a built-in implementation of exponentiation. Task Re-implement integer exponentiation for both intint and floatint as both a procedure, and an operator (if your language supports operator definition). If the language supports operator (or pr...	christopher/rosetta-code
http://rosettacode.org/wiki/Gamma_function	Gamma function	Task Implement one algorithm (or more) to compute the Gamma ( Γ {\displaystyle \Gamma } ) function (in the real field only). If your language has the function as built-in or you know a library which has it, compare your implementation's results with the results of the built-in/library function. The Gamma funct...	#Arturo	Arturo	A: @[ 1.00000000000000000000 0.57721566490153286061 neg 0.65587807152025388108 neg 0.04200263503409523553 0.16653861138229148950 neg 0.04219773455554433675 neg 0.00962197152787697356 0.00721894324666309954 neg 0.00116516759185906511 neg 0.00021524167411495097 0.00012805028238811619 neg 0.00002013485...	Give a code snippet in #Arturo Task Implement one algorithm (or more) to compute the Gamma ( Γ {\displaystyle \Gamma } ) function (in the real field only). If your language has the function as built-in or you know a library which has it, compare your implementation's results with the results of the built-in/li...	christopher/rosetta-code
http://rosettacode.org/wiki/List_rooted_trees	List rooted trees	You came back from grocery shopping. After putting away all the goods, you are left with a pile of plastic bags, which you want to save for later use, so you take one bag and stuff all the others into it, and throw it under the sink. In doing so, you realize that there are various ways of nesting the bags, with all...	#Sidef	Sidef	func bagchain(x, n, bb, start=0) { n \|\| return [x] var out = [] for i in (start .. bb.end) { var (c, s) = bb[i]... if (c <= n) { out += bagchain([x[0] + c, x[1] + s], n-c, bb, i) } } return out } func bags(n) { n \|\| return [[0, ""]] var upto = [] ...	Give a code snippet in #Sidef You came back from grocery shopping. After putting away all the goods, you are left with a pile of plastic bags, which you want to save for later use, so you take one bag and stuff all the others into it, and throw it under the sink. In doing so, you realize that there are various way...	christopher/rosetta-code

http://rosettacode.org/wiki/Five_weekends

Five weekends

The month of October in 2010 has five Fridays, five Saturdays, and five Sundays. Task Write a program to show all months that have this same characteristic of five full weekends from the year 1900 through 2100 (Gregorian calendar). Show the number of months with this property (there should be 201). Show at leas...

#Euphoria

Euphoria

--Five Weekend task from Rosetta Code wiki --User:Lnettnay include std/datetime.e atom numbermonths = 0 sequence longmonths = {1, 3, 5, 7, 8, 10, 12} sequence yearsmonths = {} atom none = 0 datetime dt for year = 1900 to 2100 do atom flag = 0 for month = 1 to length(longmonths) do dt = new(year, longmonths...

Give a code snippet in #Euphoria The month of October in 2010 has five Fridays, five Saturdays, and five Sundays. Task Write a program to show all months that have this same characteristic of five full weekends from the year 1900 through 2100 (Gregorian calendar). Show the number of months with this property (t...

christopher/rosetta-code

http://rosettacode.org/wiki/Loops/For_with_a_specified_step

Loops/For with a specified step

Task Demonstrate a for-loop where the step-value is greater than one. Related tasks Loop over multiple arrays simultaneously Loops/Break Loops/Continue Loops/Do-while Loops/Downward for Loops/For Loops/For with a specified step Loops/Foreach Loops/Increment loop index within loop b...

#Erlang

Erlang

%% Implemented by Arjun Sunel %% for_loop/4 by Bengt Kleberg. -module(loop_step). -export([main/0, for_loop/1, for_loop/4]). % This Erlang code for "For Loop" is equivalent to: " for (i=start; i<end ; i=i+2){ printf("* ");} " in C language. main() -> for_loop(1). for_loop( N ) -> for_loop( N, 4, 2, fun(...

Give a code snippet in #Erlang Task Demonstrate a for-loop where the step-value is greater than one. Related tasks Loop over multiple arrays simultaneously Loops/Break Loops/Continue Loops/Do-while Loops/Downward for Loops/For Loops/For with a specified step Loops/Foreach Loops/In...

christopher/rosetta-code

http://rosettacode.org/wiki/Sequence_of_non-squares

Sequence of non-squares

Task Show that the following remarkable formula gives the sequence of non-square natural numbers: n + floor(1/2 + sqrt(n)) Print out the values for n in the range 1 to 22 Show that no squares occur for n less than one million This is sequence A000037 in the OEIS database.

#R

R

nonsqr <- function(n) n + floor(1/2 + sqrt(n)) nonsqr(1:22)

Give a code snippet in #R Task Show that the following remarkable formula gives the sequence of non-square natural numbers: n + floor(1/2 + sqrt(n)) Print out the values for n in the range 1 to 22 Show that no squares occur for n less than one million This is sequence A000037 ...

christopher/rosetta-code

http://rosettacode.org/wiki/Zig-zag_matrix

Zig-zag matrix

Task Produce a zig-zag array. A zig-zag array is a square arrangement of the first N2 natural numbers, where the numbers increase sequentially as you zig-zag along the array's anti-diagonals. For a graphical representation, see JPG zigzag (JPG uses such arrays to encode images). For example, gi...

#Inspired_by_Rascal

Inspired by Rascal

#{ Produce a zigzag matrix. Nigel Galloway, January 26th., 2020. At the time of writing the Rascal solution is yellow flagged for producing a striped matrix. Let me make the same faux pas. #} n=5; g=1; for e=1:n i=1; for l=e:-1:1 zig(i++,l)=g++; endfor endfor for e=2:n i=e; for l=n:-1:e zig(i++,l)=g++; endfor en...

Give a code snippet in #Inspired_by_Rascal Task Produce a zig-zag array. A zig-zag array is a square arrangement of the first N2 natural numbers, where the numbers increase sequentially as you zig-zag along the array's anti-diagonals. For a graphical representation, see JPG zigzag (JPG uses such ...

christopher/rosetta-code

http://rosettacode.org/wiki/Hamming_numbers

Hamming numbers

Hamming numbers are numbers of the form H = 2i × 3j × 5k where i, j, k ≥ 0 Hamming numbers are also known as ugly numbers and also 5-smooth numbers (numbers whose prime divisors are less or equal to 5). Task Generate the sequence of Hamming numbers, in increasing order. In ...

#ATS

ATS

// // How to compile: // patscc -DATS_MEMALLOC_LIBC -o hamming hamming.dats // #include "share/atspre_staload.hats" fun min3 ( A: arrayref(int, 3) ) : natLt(3) = i where { var x: int = A[0] var i: natLt(3) = 0 val () = if A[1] < x then (x := A[1]; i := 1) val () = if A[2] < x then (x := A[2]; i := 2) } (*...

Give a code snippet in #ATS Hamming numbers are numbers of the form H = 2i × 3j × 5k where i, j, k ≥ 0 Hamming numbers are also known as ugly numbers and also 5-smooth numbers (numbers whose prime divisors are less or equal to 5). Task Generate the sequence of Hamming number...

christopher/rosetta-code

http://rosettacode.org/wiki/Ruth-Aaron_numbers

Ruth-Aaron numbers

A Ruth–Aaron pair consists of two consecutive integers (e.g., 714 and 715) for which the sums of the prime divisors of each integer are equal. So called because 714 is Babe Ruth's lifetime home run record; Hank Aaron's 715th home run broke this record and 714 and 715 have the same prime divisor sum. A Ruth–Aaron tri...

#Pascal

Pascal

program RuthAaronNumb; // gets factors of consecutive integers fast // limited to 1.2e11 {$IFDEF FPC} {$MODE DELPHI} {$OPTIMIZATION ON,ALL} {$COPERATORS ON} {$ELSE} {$APPTYPE CONSOLE} {$ENDIF} uses sysutils, strutils //Numb2USA {$IFDEF WINDOWS},Windows{$ENDIF} ; //###########################################...

Give a code snippet in #Pascal A Ruth–Aaron pair consists of two consecutive integers (e.g., 714 and 715) for which the sums of the prime divisors of each integer are equal. So called because 714 is Babe Ruth's lifetime home run record; Hank Aaron's 715th home run broke this record and 714 and 715 have the same prime ...

christopher/rosetta-code

http://rosettacode.org/wiki/Priority_queue

Priority queue

A priority queue is somewhat similar to a queue, with an important distinction: each item is added to a priority queue with a priority level, and will be later removed from the queue with the highest priority element first. That is, the items are (conceptually) stored in the queue in priority order instead of in insert...

#F.23

F#

[<RequireQualifiedAccess>] module PriorityQ = // type 'a treeElement = Element of uint32 * 'a type 'a treeElement = struct val k:uint32 val v:'a new(k,v) = { k=k;v=v } end type 'a tree = Node of uint32 * 'a treeElement * 'a tree list type 'a heap = 'a tree list [<CompilationRepresentation(CompilationRe...

Give a code snippet in #F.23 A priority queue is somewhat similar to a queue, with an important distinction: each item is added to a priority queue with a priority level, and will be later removed from the queue with the highest priority element first. That is, the items are (conceptually) stored in the queue in prior...

christopher/rosetta-code

http://rosettacode.org/wiki/Random_number_generator_(included)

Random number generator (included)

The task is to: State the type of random number generator algorithm used in a language's built-in random number generator. If the language or its immediate libraries don't provide a random number generator, skip this task. If possible, give a link to a wider explanation of the algorithm used. Note: the task is not t...

#Nanoquery

Nanoquery

setrand(3) random(6)+1 \\ chosen by fair dice roll. \\ guaranteed to the random.

Give a code snippet in #Nanoquery The task is to: State the type of random number generator algorithm used in a language's built-in random number generator. If the language or its immediate libraries don't provide a random number generator, skip this task. If possible, give a link to a wider explanation of the algo...

christopher/rosetta-code

http://rosettacode.org/wiki/Create_a_file

Create a file

In this task, the job is to create a new empty file called "output.txt" of size 0 bytes and an empty directory called "docs". This should be done twice: once "here", i.e. in the current working directory and once in the filesystem root.

#Bracmat

Bracmat

put$(,"output.txt",NEW)

Give a code snippet in #Bracmat In this task, the job is to create a new empty file called "output.txt" of size 0 bytes and an empty directory called "docs". This should be done twice: once "here", i.e. in the current working directory and once in the filesystem root.

christopher/rosetta-code

http://rosettacode.org/wiki/Babbage_problem

Babbage problem

Charles Babbage, looking ahead to the sorts of problems his Analytical Engine would be able to solve, gave this example: What is the smallest positive integer whose square ends in the digits 269,696? — Babbage, letter to Lord Bowden, 1837; see Hollingdale and Tootill, Electronic Computers, second edition, 1970, p....

#Erlang

Erlang

-module(solution1). -export([main/0]). babbage(N,E) when N*N rem 1000000 == 269696 -> io:fwrite("~p",[N]); babbage(N,E) -> case E of 4 -> babbage(N+2,6); 6 -> babbage(N+8,4) end. main()-> babbage(4,4).

Give a code snippet in #Erlang Charles Babbage, looking ahead to the sorts of problems his Analytical Engine would be able to solve, gave this example: What is the smallest positive integer whose square ends in the digits 269,696? — Babbage, letter to Lord Bowden, 1837; see Hollingdale and Tootill, Electronic Com...

christopher/rosetta-code

http://rosettacode.org/wiki/Magic_squares_of_doubly_even_order

Magic squares of doubly even order

A magic square is an N×N square matrix whose numbers consist of consecutive numbers arranged so that the sum of each row and column, and both diagonals are equal to the same sum (which is called the magic number or magic constant). A magic square of doubly even order has a size that is a multiple of four (e...

#J

J

masksq=: >:@#@, | _1&^ * 1 + i.@$ pat4=: ,:(+.|.)=i.4 mask=: ,/@(,./"3@$&pat4)@] ,~ % 4: demsq=: masksq@mask

Give a code snippet in #J A magic square is an N×N square matrix whose numbers consist of consecutive numbers arranged so that the sum of each row and column, and both diagonals are equal to the same sum (which is called the magic number or magic constant). A magic square of doubly even order has a size that...

christopher/rosetta-code

http://rosettacode.org/wiki/Factorial

Factorial

Definitions The factorial of 0 (zero) is defined as being 1 (unity). The Factorial Function of a positive integer, n, is defined as the product of the sequence: n, n-1, n-2, ... 1 Task Write a function to return the factorial of a number. Solutions can be iterat...

#Dyalect

Dyalect

func factorial(n) { if n < 2 { 1 } else { n * factorial(n - 1) } }

Give a code snippet in #Dyalect Definitions The factorial of 0 (zero) is defined as being 1 (unity). The Factorial Function of a positive integer, n, is defined as the product of the sequence: n, n-1, n-2, ... 1 Task Write a function to return the factorial of a...

christopher/rosetta-code

http://rosettacode.org/wiki/Cramer%27s_rule

Cramer's rule

linear algebra Cramer's rule system of linear equations Given { a 1 x + b 1 y + c 1 z = d 1 a 2 x + b 2 y + c 2 z = d 2 a 3 x + b 3 y + c 3 z = d 3 {\displaystyle \left\{{\begin{matrix}a_{1}x+b_{1}y+c_{1}z&={\color {red}d_{1...

#Wren

Wren

import "/matrix" for Matrix var cramer = Fn.new { |a, d| var n = a.numRows var x = List.filled(n, 0) var ad = a.det for (c in 0...n) { var aa = a.copy() for (r in 0...n) aa[r, c] = d[r, 0] x[c] = aa.det/ad } return x } var a = Matrix.new([ [2, -1, 5, 1], [3,...

Give a code snippet in #Wren linear algebra Cramer's rule system of linear equations Given { a 1 x + b 1 y + c 1 z = d 1 a 2 x + b 2 y + c 2 z = d 2 a 3 x + b 3 y + c 3 z = d 3 {\displaystyle \left\{{\begin{matrix}a_{1}x+b_...

christopher/rosetta-code

http://rosettacode.org/wiki/Function_definition

Function definition

A function is a body of code that returns a value. The value returned may depend on arguments provided to the function. Task Write a definition of a function called "multiply" that takes two arguments and returns their product. (Argument types should be chosen so as not to distract from showing how functions are ...

#AntLang

AntLang

multiply: * /`*' is a normal function multiply: {x * y}

Give a code snippet in #AntLang A function is a body of code that returns a value. The value returned may depend on arguments provided to the function. Task Write a definition of a function called "multiply" that takes two arguments and returns their product. (Argument types should be chosen so as not to distrac...

christopher/rosetta-code

http://rosettacode.org/wiki/Damm_algorithm

Damm algorithm

The Damm algorithm is a checksum algorithm which detects all single digit errors and adjacent transposition errors. The algorithm is named after H. Michael Damm. Task Verify the checksum, stored as last digit of an input.

#Java

Java

public class DammAlgorithm { private static final int[][] table = { {0, 3, 1, 7, 5, 9, 8, 6, 4, 2}, {7, 0, 9, 2, 1, 5, 4, 8, 6, 3}, {4, 2, 0, 6, 8, 7, 1, 3, 5, 9}, {1, 7, 5, 0, 9, 8, 3, 4, 2, 6}, {6, 1, 2, 3, 0, 4, 5, 9, 7, 8}, {3, 6, 7, 4, 2, 0, 9, 5, 8, 1}, ...

Give a code snippet in #Java The Damm algorithm is a checksum algorithm which detects all single digit errors and adjacent transposition errors. The algorithm is named after H. Michael Damm. Task Verify the checksum, stored as last digit of an input.

christopher/rosetta-code

http://rosettacode.org/wiki/Loops/Do-while

Loops/Do-while

Start with a value at 0. Loop while value mod 6 is not equal to 0. Each time through the loop, add 1 to the value then print it. The loop must execute at least once. Related tasks Loop over multiple arrays simultaneously Loops/Break Loops/Continue Loops/Do-while Loops/Downward for Loops/For Loo...

#Elixir

Elixir

defmodule Loops do def do_while(n) do n1 = n + 1 IO.puts n1 if rem(n1, 6) == 0, do: :ok, else: do_while(n1) end end Loops.do_while(0)

Give a code snippet in #Elixir Start with a value at 0. Loop while value mod 6 is not equal to 0. Each time through the loop, add 1 to the value then print it. The loop must execute at least once. Related tasks Loop over multiple arrays simultaneously Loops/Break Loops/Continue Loops/Do-while Loops/...

christopher/rosetta-code

http://rosettacode.org/wiki/Bitmap/Read_a_PPM_file

Bitmap/Read a PPM file

Using the data storage type defined on this page for raster images, read an image from a PPM file (binary P6 prefered). (Read the definition of PPM file on Wikipedia.) Task: Use write ppm file solution and grayscale image solution with this one in order to convert a color image to grayscale one.

#Perl

Perl

#! /usr/bin/perl use strict; use Image::Imlib2; my $img = Image::Imlib2->load("out0.ppm"); # let's do something with it now $img->set_color(255, 255, 255, 255); $img->draw_line(0,0, $img->width,$img->height); $img->image_set_format("png"); $img->save("out1.png"); exit 0;

Give a code snippet in #Perl Using the data storage type defined on this page for raster images, read an image from a PPM file (binary P6 prefered). (Read the definition of PPM file on Wikipedia.) Task: Use write ppm file solution and grayscale image solution with this one in order to convert a color image to graysca...

christopher/rosetta-code

http://rosettacode.org/wiki/Sailors,_coconuts_and_a_monkey_problem

Sailors, coconuts and a monkey problem

Five sailors are shipwrecked on an island and collect a large pile of coconuts during the day. That night the first sailor wakes up and decides to take his first share early so tries to divide the pile of coconuts equally into five piles but finds that there is one coconut left over, so he tosses it to a monkey and th...

#J

J

I.(=<.)%&5 verb def'4*(y-1)%5'^:5 i.10000 3121

Give a code snippet in #J Five sailors are shipwrecked on an island and collect a large pile of coconuts during the day. That night the first sailor wakes up and decides to take his first share early so tries to divide the pile of coconuts equally into five piles but finds that there is one coconut left over, so he t...

christopher/rosetta-code

http://rosettacode.org/wiki/Create_an_object_at_a_given_address

Create an object at a given address

Basic Data Operation This is a basic data operation. It represents a fundamental action on a basic data type. You may see other such operations in the Basic Data Operations category, or: Integer Operations Arithmetic | Comparison Boolean Operations Bitwise | Logical String Operations Concatenation | Interpolation |...

#BBC_BASIC

BBC BASIC

REM Create an integer object: anInteger% = 12345678 PRINT "Original value =", anInteger% REM Print the machine address of the object: address% = ^anInteger% PRINT "Hexadecimal address = ";~address% REM Take the address of the object and create REM another integer ob...

Give a code snippet in #BBC_BASIC Basic Data Operation This is a basic data operation. It represents a fundamental action on a basic data type. You may see other such operations in the Basic Data Operations category, or: Integer Operations Arithmetic | Comparison Boolean Operations Bitwise | Logical String Operati...

christopher/rosetta-code

http://rosettacode.org/wiki/Currying

Currying

This page uses content from Wikipedia. The original article was at Currying. The list of authors can be seen in the page history. As with Rosetta Code, the text of Wikipedia is available under the GNU FDL. (See links for details on variance) Task Create a simple demonstrative example of Currying in a specific la...

#REXX

REXX

/*REXX program demonstrates a REXX currying method to perform addition. */ say 'add 2 to 3: ' add(2, 3) say 'add 2 to 3 (curried):' add2(3) exit /*stick a fork in it, we're all done. */ /*──────────────────────────────────────────────────────────...

Give a code snippet in #REXX This page uses content from Wikipedia. The original article was at Currying. The list of authors can be seen in the page history. As with Rosetta Code, the text of Wikipedia is available under the GNU FDL. (See links for details on variance) Task Create a simple demonstrative exampl...

christopher/rosetta-code

http://rosettacode.org/wiki/Spinning_rod_animation/Text

Spinning rod animation/Text

Task An animation with the following frames in the following order (if certain characters aren't available or can't be used correctly in the programming language, alternate characters can replace any of these frames) must animate with a delay of 0.25 seconds between each frame, with the previous frame being cleared be...

#Rust

Rust

fn main() { let characters = ['|', '/', '-', '\\']; let mut current = 0; println!("{}[2J", 27 as char); // Clear screen. loop { println!("{}[;H{}", 27 as char, characters[current]); // Move cursor to 1,1 and output the next character. current += 1; // Advance current character. ...

Give a code snippet in #Rust Task An animation with the following frames in the following order (if certain characters aren't available or can't be used correctly in the programming language, alternate characters can replace any of these frames) must animate with a delay of 0.25 seconds between each frame, with the p...

christopher/rosetta-code

http://rosettacode.org/wiki/Exceptions/Catch_an_exception_thrown_in_a_nested_call

Exceptions/Catch an exception thrown in a nested call

Show how to create a user-defined exception and show how to catch an exception raised from several nested calls away. Create two user-defined exceptions, U0 and U1. Have function foo call function bar twice. Have function bar call function baz. Arrange for function baz to rais...

#Mathematica_.2F_Wolfram_Language

Mathematica / Wolfram Language

foo[] := Catch[ bar[1]; bar[2]; ] bar[i_] := baz[i]; baz[i_] := Switch[i, 1, Throw["Exception U0 in baz"];, 2, Throw["Exception U1 in baz"];]

Give a code snippet in #Mathematica_.2F_Wolfram_Language Show how to create a user-defined exception and show how to catch an exception raised from several nested calls away. Create two user-defined exceptions, U0 and U1. Have function foo call function bar twice. Have function bar cal...

christopher/rosetta-code

http://rosettacode.org/wiki/Literals/Integer

Literals/Integer

Some programming languages have ways of expressing integer literals in bases other than the normal base ten. Task Show how integer literals can be expressed in as many bases as your language allows. Note: this should not involve the calling of any functions/methods, but should be interpreted by the compiler or...

#Logtalk

Logtalk

:- object(integers). :- public(show/0). show :- write('Binary 0b11110101101 = '), write(0b11110101101), nl, write('Octal 0o3655 = '), write(0o3655), nl, write('Decimal 1965 = '), write(1965), nl, write('Hexadecimal 0x7AD = '), write(0x...

Give a code snippet in #Logtalk Some programming languages have ways of expressing integer literals in bases other than the normal base ten. Task Show how integer literals can be expressed in as many bases as your language allows. Note: this should not involve the calling of any functions/methods, but should ...

christopher/rosetta-code

http://rosettacode.org/wiki/Vigen%C3%A8re_cipher

Vigenère cipher

Task Implement a Vigenère cypher, both encryption and decryption. The program should handle keys and text of unequal length, and should capitalize everything and discard non-alphabetic characters. (If your program handles non-alphabetic characters in another way, make a note of it.) Related tasks Caesar ...

#Elixir

Elixir

defmodule VigenereCipher do @base ?A @size ?Z - @base + 1 def encrypt(text, key), do: crypt(text, key, 1) def decrypt(text, key), do: crypt(text, key, -1) defp crypt(text, key, dir) do text = String.upcase(text) |> String.replace(~r/[^A-Z]/, "") |> to_char_list key_iterator = String.upcase(key...

Give a code snippet in #Elixir Task Implement a Vigenère cypher, both encryption and decryption. The program should handle keys and text of unequal length, and should capitalize everything and discard non-alphabetic characters. (If your program handles non-alphabetic characters in another way, make a note of i...

christopher/rosetta-code

http://rosettacode.org/wiki/Closest-pair_problem

Closest-pair problem

This page uses content from Wikipedia. The original article was at Closest pair of points problem. The list of authors can be seen in the page history. As with Rosetta Code, the text of Wikipedia is available under the GNU FDL. (See links for details on variance) Task Provide a function to find the closest two p...

#Julia

Julia

function closestpair(P::Vector{Vector{T}}) where T <: Number N = length(P) if N < 2 return (Inf, ()) end mindst = norm(P[1] - P[2]) minpts = (P[1], P[2]) for i in 1:N-1, j in i+1:N tmpdst = norm(P[i] - P[j]) if tmpdst < mindst mindst = tmpdst minpts = (P[i], P...

Give a code snippet in #Julia This page uses content from Wikipedia. The original article was at Closest pair of points problem. The list of authors can be seen in the page history. As with Rosetta Code, the text of Wikipedia is available under the GNU FDL. (See links for details on variance) Task Provide a fun...

christopher/rosetta-code

http://rosettacode.org/wiki/Exceptions/Catch_an_exception_thrown_in_a_nested_call

Exceptions/Catch an exception thrown in a nested call

Show how to create a user-defined exception and show how to catch an exception raised from several nested calls away. Create two user-defined exceptions, U0 and U1. Have function foo call function bar twice. Have function bar call function baz. Arrange for function baz to rais...

#C.2B.2B

C++

#include <iostream> class U0 {}; class U1 {}; void baz(int i) { if (!i) throw U0(); else throw U1(); } void bar(int i) { baz(i); } void foo() { for (int i = 0; i < 2; i++) { try { bar(i); } catch(U0 e) { std::cout<< "Exception U0 caught\n"; } } } int ma...

Give a code snippet in #C.2B.2B Show how to create a user-defined exception and show how to catch an exception raised from several nested calls away. Create two user-defined exceptions, U0 and U1. Have function foo call function bar twice. Have function bar call function baz. Arr...

christopher/rosetta-code

http://rosettacode.org/wiki/Show_the_epoch

Show the epoch

Task Choose popular date libraries used by your language and show the epoch those libraries use. A demonstration is preferable (e.g. setting the internal representation of the date to 0 ms/ns/etc., or another way that will still show the epoch even if it is changed behind the scenes by the implementers), b...

#Mathematica.2FWolfram_Language

Mathematica/Wolfram Language

DateString[0]

Give a code snippet in #Mathematica.2FWolfram_Language Task Choose popular date libraries used by your language and show the epoch those libraries use. A demonstration is preferable (e.g. setting the internal representation of the date to 0 ms/ns/etc., or another way that will still show the epoch even if i...

christopher/rosetta-code

http://rosettacode.org/wiki/Reflection/Get_source

Reflection/Get source

Task The goal is to get the source code or file path and line number where a programming object (e.g. module, class, function, method) is defined.

#Smalltalk

Smalltalk

mthd := someClass compiledMethodAt:#nameOfMethod

Give a code snippet in #Smalltalk Task The goal is to get the source code or file path and line number where a programming object (e.g. module, class, function, method) is defined.

christopher/rosetta-code

http://rosettacode.org/wiki/Number_names

Number names

Task Show how to spell out a number in English. You can use a preexisting implementation or roll your own, but you should support inputs up to at least one million (or the maximum value of your language's default bounded integer type, if that's less). Support for inputs other than positive integers (like zero, negat...

#Prolog

Prolog

:- module(spell, [spell/2]). % % spell numbers up to the nonillions. % ones(1, "one"). ones(2, "two"). ones(3, "three"). ones(4, "four"). ones( 5, "five"). ones(6, "six"). ones(7, "seven"). ones(8, "eight"). ones(9, "nine"). ones(10, "ten"). ones(11, "eleven"). ones(12, "twelve"). ones(13, "thi...

Give a code snippet in #Prolog Task Show how to spell out a number in English. You can use a preexisting implementation or roll your own, but you should support inputs up to at least one million (or the maximum value of your language's default bounded integer type, if that's less). Support for inputs other than pos...

christopher/rosetta-code

http://rosettacode.org/wiki/Hello_world/Text

Hello world/Text

Hello world/Text is part of Short Circuit's Console Program Basics selection. Task Display the string Hello world! on a text console. Related tasks Hello world/Graphical Hello world/Line Printer Hello world/Newbie Hello world/Newline omission Hello world/Standard error Hello world/Web server

#RASEL

RASEL

A"!dlroW ,olleH">:?@,Hj

Give a code snippet in #RASEL Hello world/Text is part of Short Circuit's Console Program Basics selection. Task Display the string Hello world! on a text console. Related tasks Hello world/Graphical Hello world/Line Printer Hello world/Newbie Hello world/Newline omission Hello world/Standard error ...

christopher/rosetta-code

http://rosettacode.org/wiki/Look-and-say_sequence

Look-and-say sequence

The Look and say sequence is a recursively defined sequence of numbers studied most notably by John Conway. The look-and-say sequence is also known as the Morris Number Sequence, after cryptographer Robert Morris, and the puzzle What is the next number in the sequence 1, 11, 21, 1211, 11122...

#PureBasic

PureBasic

If OpenConsole() Define i, j, cnt, txt$, curr$, result$ Print("Enter start sequence: "): txt$=Input() Print("How many repetitions: "): i=Val(Input()) ; PrintN(#CRLF$+"Sequence:"+#CRLF$+txt$) Repeat j=1 result$="" Repeat curr$=Mid(txt$,j,1) cnt=0 Repeat cnt+1 j+1...

Give a code snippet in #PureBasic The Look and say sequence is a recursively defined sequence of numbers studied most notably by John Conway. The look-and-say sequence is also known as the Morris Number Sequence, after cryptographer Robert Morris, and the puzzle What is the next number in the sequ...

christopher/rosetta-code

http://rosettacode.org/wiki/File_input/output

File input/output

File input/output is part of Short Circuit's Console Program Basics selection. Task Create a file called "output.txt", and place in it the contents of the file "input.txt", via an intermediate variable. In other words, your program will demonstrate: how to read from a file into a variable how to write ...

#Object_Pascal

Object Pascal

uses classes; begin with TFileStream.Create('input.txt', fmOpenRead) do try SaveToFile('output.txt'); finally Free; end; end;

Give a code snippet in #Object_Pascal File input/output is part of Short Circuit's Console Program Basics selection. Task Create a file called "output.txt", and place in it the contents of the file "input.txt", via an intermediate variable. In other words, your program will demonstrate: how to read from ...

christopher/rosetta-code

http://rosettacode.org/wiki/Integer_comparison

Integer comparison

Basic Data Operation This is a basic data operation. It represents a fundamental action on a basic data type. You may see other such operations in the Basic Data Operations category, or: Integer Operations Arithmetic | Comparison Boolean Operations Bitwise | Logical String Operations Concatenation | Interpolation |...

#AArch64_Assembly

AArch64 Assembly

.equ STDOUT, 1 .equ SVC_WRITE, 64 .equ SVC_EXIT, 93 .text .global _start _start: stp x29, x30, [sp, -16]! mov x0, #123 mov x1, #456 mov x29, sp bl integer_compare // integer_compare(123, 456); mov x0, #-123 mov x1, #-456 bl integer_compare // integer_compare(-123, -456); mov x0, #123 mov x1, #123 bl inte...

Give a code snippet in #AArch64_Assembly Basic Data Operation This is a basic data operation. It represents a fundamental action on a basic data type. You may see other such operations in the Basic Data Operations category, or: Integer Operations Arithmetic | Comparison Boolean Operations Bitwise | Logical String ...

christopher/rosetta-code

http://rosettacode.org/wiki/Van_der_Corput_sequence

Van der Corput sequence

When counting integers in binary, if you put a (binary) point to the righEasyLangt of the count then the column immediately to the left denotes a digit with a multiplier of 2 0 {\displaystyle 2^{0}} ; the digit in the next column to the left has a multiplier of 2 1 {\displaystyle 2^{1}} ; and so o...

#Cowgol

Cowgol

include "cowgol.coh"; sub vc(n: uint16, base: uint16): (num: uint16, denom: uint16) is var p: uint16 := 0; var q: uint16 := 1; while n != 0 loop p := p * base + n % base; q := q * base; n := n / base; end loop; num := p; denom := q; while p != 0 loop n...

Give a code snippet in #Cowgol When counting integers in binary, if you put a (binary) point to the righEasyLangt of the count then the column immediately to the left denotes a digit with a multiplier of 2 0 {\displaystyle 2^{0}} ; the digit in the next column to the left has a multiplier of 2 1 {...

christopher/rosetta-code

http://rosettacode.org/wiki/Averages/Arithmetic_mean

Averages/Arithmetic mean

Task[edit] Write a program to find the mean (arithmetic average) of a numeric vector. In case of a zero-length input, since the mean of an empty set of numbers is ill-defined, the program may choose to behave in any way it deems appropriate, though if the programming language has an established convention for conveyin...

#PARI.2FGP

PARI/GP

avg(v)={ if(#v,vecsum(v)/#v) };

Give a code snippet in #PARI.2FGP Task[edit] Write a program to find the mean (arithmetic average) of a numeric vector. In case of a zero-length input, since the mean of an empty set of numbers is ill-defined, the program may choose to behave in any way it deems appropriate, though if the programming language has an ...

christopher/rosetta-code

http://rosettacode.org/wiki/Sorting_algorithms/Bogosort

Sorting algorithms/Bogosort

Sorting Algorithm This is a sorting algorithm. It may be applied to a set of data in order to sort it. For comparing various sorts, see compare sorts. For other sorting algorithms, see sorting algorithms, or: O(n logn) sorts Heap sort | Merge sort | Patience sort | Quick sort O(n log2n) sorts Shell Sort ...

#Ada

Ada

with Ada.Text_IO; use Ada.Text_IO; with Ada.Numerics.Discrete_Random; procedure Test_Bogosort is generic type Ordered is private; type List is array (Positive range <>) of Ordered; with function "<" (L, R : Ordered) return Boolean is <>; procedure Bogosort (Data : in out List); procedure...

Give a code snippet in #Ada Sorting Algorithm This is a sorting algorithm. It may be applied to a set of data in order to sort it. For comparing various sorts, see compare sorts. For other sorting algorithms, see sorting algorithms, or: O(n logn) sorts Heap sort | Merge sort | Patience sort | Quick sort...

christopher/rosetta-code

http://rosettacode.org/wiki/Teacup_rim_text

Teacup rim text

On a set of coasters we have, there's a picture of a teacup. On the rim of the teacup the word TEA appears a number of times separated by bullet characters (•). It occurred to me that if the bullet were removed and the words run together, you could start at any letter and still end up with a meaningful three...

#Python

Python

'''Teacup rim text''' from itertools import chain, groupby from os.path import expanduser from functools import reduce # main :: IO () def main(): '''Circular anagram groups, of more than one word, and containing words of length > 2, found in: https://www.mit.edu/~ecprice/wordlist.10000 ''' ...

Give a code snippet in #Python On a set of coasters we have, there's a picture of a teacup. On the rim of the teacup the word TEA appears a number of times separated by bullet characters (•). It occurred to me that if the bullet were removed and the words run together, you could start at any letter and stil...

christopher/rosetta-code

http://rosettacode.org/wiki/String_length

String length

Task Find the character and byte length of a string. This means encodings like UTF-8 need to be handled properly, as there is not necessarily a one-to-one relationship between bytes and characters. By character, we mean an individual Unicode code point, not a user-visible grapheme containing combining characters. F...

#LabVIEW

LabVIEW

{script LAMBDATALK.DICT["W.unicodeLength"] = function() { function countCodePoints(str) { var point, index, width = 0, len = 0; for (index = 0; index < str.length;) { point = str.codePointAt(index); width = 0; while (point) { width += 1; point =...

Give a code snippet in #LabVIEW Task Find the character and byte length of a string. This means encodings like UTF-8 need to be handled properly, as there is not necessarily a one-to-one relationship between bytes and characters. By character, we mean an individual Unicode code point, not a user-visible grapheme co...

christopher/rosetta-code

http://rosettacode.org/wiki/Mad_Libs

Mad Libs

This page uses content from Wikipedia. The original article was at Mad Libs. The list of authors can be seen in the page history. As with Rosetta Code, the text of Wikipedia is available under the GNU FDL. (See links for details on variance) Mad Libs is a phrasal template word game where one player prompts another...

#Phix

Phix

without js -- file i/o, prompt_string string mlfile = "", -- eg story.txt mltxt = iff(length(mlfile)?join(read_lines(mlfile),"\n"):""" <name> went for a walk in the park. <he or she> found a <noun>. <name> decided to take it home. """) sequence strings = {}, replacements = {} integer startpos, endpos=1 while 1 do ...

Give a code snippet in #Phix This page uses content from Wikipedia. The original article was at Mad Libs. The list of authors can be seen in the page history. As with Rosetta Code, the text of Wikipedia is available under the GNU FDL. (See links for details on variance) Mad Libs is a phrasal template word game wh...

christopher/rosetta-code

http://rosettacode.org/wiki/Binary_search

Binary search

A binary search divides a range of values into halves, and continues to narrow down the field of search until the unknown value is found. It is the classic example of a "divide and conquer" algorithm. As an analogy, consider the children's game "guess a number." The scorer has a secret number, and will only tell the p...

#Eiffel

Eiffel

class APPLICATION create make feature {NONE} -- Initialization make local a: ARRAY [INTEGER] keys: ARRAY [INTEGER] do a := <<0, 1, 4, 5, 6, 7, 8, 9, 12, 26, 45, 67, 78, 90, 98, 123, 211, 234, 456, 769, 865, 2345, 3215, 14345, 24324>> keys := <<0, 42, 45, ...

Give a code snippet in #Eiffel A binary search divides a range of values into halves, and continues to narrow down the field of search until the unknown value is found. It is the classic example of a "divide and conquer" algorithm. As an analogy, consider the children's game "guess a number." The scorer has a secret ...

christopher/rosetta-code

http://rosettacode.org/wiki/Man_or_boy_test

Man or boy test

Man or boy test You are encouraged to solve this task according to the task description, using any language you may know. Background: The man or boy test was proposed by computer scientist Donald Knuth as a means of evaluating implementations of the ALGOL 60 programming language. The aim of the test was to distinguis...

#Scala

Scala

def A(in_k: Int, x1: =>Int, x2: =>Int, x3: =>Int, x4: =>Int, x5: =>Int): Int = { var k = in_k def B: Int = { k = k-1 A(k, B, x1, x2, x3, x4) } if (k<=0) x4+x5 else B } println(A(10, 1, -1, -1, 1, 0))

Give a code snippet in #Scala Man or boy test You are encouraged to solve this task according to the task description, using any language you may know. Background: The man or boy test was proposed by computer scientist Donald Knuth as a means of evaluating implementations of the ALGOL 60 programming language. The ai...

christopher/rosetta-code

http://rosettacode.org/wiki/Least_common_multiple

Least common multiple

Least common multiple You are encouraged to solve this task according to the task description, using any language you may know. Task Compute the least common multiple (LCM) of two integers. Given m and n, the least common multiple is the smallest positive integer that has both m and n as factor...

#PureBasic

PureBasic

Procedure GCDiv(a, b); Euclidean algorithm Protected r While b r = b b = a%b a = r Wend ProcedureReturn a EndProcedure Procedure LCM(m,n) Protected t If m And n t=m*n/GCDiv(m,n) EndIf ProcedureReturn t*Sign(t) EndProcedure

Give a code snippet in #PureBasic Least common multiple You are encouraged to solve this task according to the task description, using any language you may know. Task Compute the least common multiple (LCM) of two integers. Given m and n, the least common multiple is the smallest positive integer that...

christopher/rosetta-code

http://rosettacode.org/wiki/Fibonacci_sequence

Fibonacci sequence

The Fibonacci sequence is a sequence Fn of natural numbers defined recursively: F0 = 0 F1 = 1 Fn = Fn-1 + Fn-2, if n>1 Task Write a function to generate the nth Fibonacci number. Solutions can be iterative or recursive (though recursive solutions are generally considered too slow ...

#Falcon

Falcon

function fib_i(n) if n < 2: return n fibPrev = 1 fib = 1 for i in [2:n] tmp = fib fib += fibPrev fibPrev = tmp end return fib end

Give a code snippet in #Falcon The Fibonacci sequence is a sequence Fn of natural numbers defined recursively: F0 = 0 F1 = 1 Fn = Fn-1 + Fn-2, if n>1 Task Write a function to generate the nth Fibonacci number. Solutions can be iterative or recursive (though recursive solutions ar...

christopher/rosetta-code

http://rosettacode.org/wiki/Square_but_not_cube

Square but not cube

Task Show the first 30 positive integers which are squares but not cubes of such integers. Optionally, show also the first 3 positive integers which are both squares and cubes, and mark them as such.

#Cowgol

Cowgol

include "cowgol.coh"; var cube: uint16 := 1; var ncube: uint16 := 1; var sqr: uint16 := 1; var nsqr: uint16 := 1; var seen: uint8 := 0; while seen < 30 loop sqr := nsqr * nsqr; while sqr > cube loop ncube := ncube + 1; cube := ncube * ncube * ncube; end loop; if sqr != cube then ...

Give a code snippet in #Cowgol Task Show the first 30 positive integers which are squares but not cubes of such integers. Optionally, show also the first 3 positive integers which are both squares and cubes, and mark them as such.

christopher/rosetta-code

http://rosettacode.org/wiki/Loops/For

Loops/For

“For” loops are used to make some block of code be iterated a number of times, setting a variable or parameter to a monotonically increasing integer value for each execution of the block of code. Common extensions of this allow other counting patterns or iterating over abstract structures other than the integers. ...

#Sather

Sather

class MAIN is -- from, to, step for!(once init:INT, once to:INT, once inc:INT):INT is i ::= init; loop while!( i <= to ); yield i; i := i + inc; end; end; main is i, j :INT; loop i := for!(1, 5, 1); -- 1.upto!(5) loop j := for!(1, i, 1); -- 1.upto!(i) #OUT + "*"...

Give a code snippet in #Sather “For” loops are used to make some block of code be iterated a number of times, setting a variable or parameter to a monotonically increasing integer value for each execution of the block of code. Common extensions of this allow other counting patterns or iterating over abstract struct...

christopher/rosetta-code

http://rosettacode.org/wiki/Hello_world/Line_printer

Hello world/Line printer

Task Cause a line printer attached to the computer to print a line containing the message: Hello World! Note A line printer is not the same as standard output. A line printer was an older-style printer which prints one line at a time to a continuous ream of paper. With some systems, a line printer can be...

#X86_Assembly

X86 Assembly

;Assemble with: tasm, tlink /t ;assume direction bit is clear (so si increments) .model tiny .code org 100h start: mov si, offset msg ;point to message jmp pr20 pr10: mov ah, 0 ;write character to printer mov dx, 0 ;LPT1 int ...

Give a code snippet in #X86_Assembly Task Cause a line printer attached to the computer to print a line containing the message: Hello World! Note A line printer is not the same as standard output. A line printer was an older-style printer which prints one line at a time to a continuous ream of paper. Wi...

christopher/rosetta-code

http://rosettacode.org/wiki/Ordered_words

Ordered words

An ordered word is a word in which the letters appear in alphabetic order. Examples include abbey and dirt. Task[edit] Find and display all the ordered words in the dictionary unixdict.txt that have the longest word length. (Examples that access the dictionary file locally assume that you have download...

#PicoLisp

PicoLisp

(in "unixdict.txt" (mapc prinl (maxi '((L) (length (car L))) (by length group (filter '((S) (apply <= S)) (make (while (line) (link @))) ) ) ) ) )

Give a code snippet in #PicoLisp An ordered word is a word in which the letters appear in alphabetic order. Examples include abbey and dirt. Task[edit] Find and display all the ordered words in the dictionary unixdict.txt that have the longest word length. (Examples that access the dictionary file loc...

christopher/rosetta-code

http://rosettacode.org/wiki/Window_creation/X11

Window creation/X11

Task Create a simple X11 application, using an X11 protocol library such as Xlib or XCB, that draws a box and "Hello World" in a window. Implementations of this task should avoid using a toolkit as much as possible.

#Java

Java

javac WindowExample.java

Give a code snippet in #Java Task Create a simple X11 application, using an X11 protocol library such as Xlib or XCB, that draws a box and "Hello World" in a window. Implementations of this task should avoid using a toolkit as much as possible.

christopher/rosetta-code

http://rosettacode.org/wiki/Determine_if_a_string_has_all_the_same_characters

Determine if a string has all the same characters

Task Given a character string (which may be empty, or have a length of zero characters): create a function/procedure/routine to: determine if all the characters in the string are the same indicate if or which character is different from the previous character display each string and its length (as the...

#Ring

Ring

nputStr = [""," ","2","333",".55","tttTTT","4444 444k"] for word in inputStr for x = 1 to len(word) for y = x + 1 to len(word) if word[x] != word[y] char = word[y] ? "Input = " + "'" + word + "'" + ", length = " + len(word) ? " First difference ...

Give a code snippet in #Ring Task Given a character string (which may be empty, or have a length of zero characters): create a function/procedure/routine to: determine if all the characters in the string are the same indicate if or which character is different from the previous character display each s...

christopher/rosetta-code

http://rosettacode.org/wiki/Create_a_file

Create a file

In this task, the job is to create a new empty file called "output.txt" of size 0 bytes and an empty directory called "docs". This should be done twice: once "here", i.e. in the current working directory and once in the filesystem root.

#zkl

zkl

$ ls -l docs ls: cannot access docs: No such file or directory $ zkl zkl: fcn createOutputTxt(dir){ dir=dir+"/docs"; File.mkdir(dir); File(dir+"/output.txt","w") } Void zkl: createOutputTxt(".") File(./docs/output.txt) zkl: createOutputTxt("/") Stack trace for VM#1 ...

Give a code snippet in #zkl In this task, the job is to create a new empty file called "output.txt" of size 0 bytes and an empty directory called "docs". This should be done twice: once "here", i.e. in the current working directory and once in the filesystem root.

christopher/rosetta-code

http://rosettacode.org/wiki/Factorial

Factorial

Definitions The factorial of 0 (zero) is defined as being 1 (unity). The Factorial Function of a positive integer, n, is defined as the product of the sequence: n, n-1, n-2, ... 1 Task Write a function to return the factorial of a number. Solutions can be iterat...

#VHDL

VHDL

LIBRARY ieee; USE ieee.std_logic_1164.ALL; USE ieee.numeric_std.ALL; ENTITY Factorial IS GENERIC ( Nbin : INTEGER := 3 ; -- number of bit to input number Nbou : INTEGER := 13) ; -- number of bit to output factorial PORT ( clk : IN STD_LOGIC ; -- clock of circuit sr : IN STD_LOGIC_VECTOR(1 DOWNTO 0); -...

Give a code snippet in #VHDL Definitions The factorial of 0 (zero) is defined as being 1 (unity). The Factorial Function of a positive integer, n, is defined as the product of the sequence: n, n-1, n-2, ... 1 Task Write a function to return the factorial of a nu...

christopher/rosetta-code

http://rosettacode.org/wiki/Power_set

Power set

A set is a collection (container) of certain values, without any particular order, and no repeated values. It corresponds with a finite set in mathematics. A set can be implemented as an associative array (partial mapping) in which the value of each key-value pair is ignored. Given a set S, the power set (or pow...

#ALGOL_68

ALGOL 68

MODE MEMBER = INT; PROC power set = ([]MEMBER s)[][]MEMBER:( [2**UPB s]FLEX[1:0]MEMBER r; INT upb r := 0; r[upb r +:= 1] := []MEMBER(()); FOR i TO UPB s DO MEMBER e = s[i]; FOR j TO upb r DO [UPB r[j] + 1]MEMBER x; x[:UPB x-1] := r[j]; x[UPB x] := e; # append to the end of x # ...

Give a code snippet in #ALGOL_68 A set is a collection (container) of certain values, without any particular order, and no repeated values. It corresponds with a finite set in mathematics. A set can be implemented as an associative array (partial mapping) in which the value of each key-value pair is ignored. Gi...

christopher/rosetta-code

http://rosettacode.org/wiki/Terminal_control/Preserve_screen

Terminal control/Preserve screen

Task Clear the screen, output something on the display, and then restore the screen to the preserved state that it was in before the task was carried out. There is no requirement to change the font or kerning in this task, however character decorations and attributes are expected to be preserved. If the implement...

#BBC_BASIC

BBC BASIC

PRINT "This is the original screen" OSCLI "GSAVE """ + @tmp$ + "bbcsave""" WAIT 200 CLS PRINT "This is the new screen, following a CLS" WAIT 200 OSCLI "DISPLAY """ + @tmp$ + "bbcsave"""

Give a code snippet in #BBC_BASIC Task Clear the screen, output something on the display, and then restore the screen to the preserved state that it was in before the task was carried out. There is no requirement to change the font or kerning in this task, however character decorations and attributes are expected ...

christopher/rosetta-code

http://rosettacode.org/wiki/Video_display_modes

Video display modes

The task is to demonstrate how to switch video display modes within the language. A brief description of the supported video modes would be useful.

#Python

Python

import win32api import win32con import pywintypes devmode=pywintypes.DEVMODEType() devmode.PelsWidth=640 devmode.PelsHeight=480 devmode.Fields=win32con.DM_PELSWIDTH | win32con.DM_PELSHEIGHT win32api.ChangeDisplaySettings(devmode,0)

Give a code snippet in #Python The task is to demonstrate how to switch video display modes within the language. A brief description of the supported video modes would be useful.

christopher/rosetta-code

http://rosettacode.org/wiki/SHA-256

SHA-256

SHA-256 is the recommended stronger alternative to SHA-1. See FIPS PUB 180-4 for implementation details. Either by using a dedicated library or implementing the algorithm in your language, show that the SHA-256 digest of the string "Rosetta code" is: 764faf5c61ac315f1497f9dfa542713965b785e5cc2f707d6468d7d1124cdfcf

#Haxe

Haxe

import haxe.crypto.Sha256; class Main { static function main() { var sha256 = Sha256.encode("Rosetta code"); Sys.println(sha256); } }

Give a code snippet in #Haxe SHA-256 is the recommended stronger alternative to SHA-1. See FIPS PUB 180-4 for implementation details. Either by using a dedicated library or implementing the algorithm in your language, show that the SHA-256 digest of the string "Rosetta code" is: 764faf5c61ac315f1497f9dfa542713965b785...

christopher/rosetta-code

http://rosettacode.org/wiki/Calculating_the_value_of_e

Calculating the value of e

Task Calculate the value of e. (e is also known as Euler's number and Napier's constant.) See details: Calculating the value of e

#TI-83_BASIC

TI-83 BASIC

0->D 2->N 2->E 1->F 1.0E-12->Z While abs(E-D)>Z F*N->F N+1->N E->D E+1/F->E End Disp E

Give a code snippet in #TI-83_BASIC Task Calculate the value of e. (e is also known as Euler's number and Napier's constant.) See details: Calculating the value of e

christopher/rosetta-code

http://rosettacode.org/wiki/Anagrams/Deranged_anagrams

Anagrams/Deranged anagrams

Two or more words are said to be anagrams if they have the same characters, but in a different order. By analogy with derangements we define a deranged anagram as two words with the same characters, but in which the same character does not appear in the same position in both words. Task[edit] Use the word list at uni...

#OCaml

OCaml

let sort_chars s = let r = String.copy s in for i = 0 to (String.length r) - 2 do for j = i + 1 to (String.length r) - 1 do if r.[i] > r.[j] then begin let tmp = r.[i] in r.[i] <- r.[j]; r.[j] <- tmp; end done done; (r) let deranged (s1, s2) = let len1 = String.le...

Give a code snippet in #OCaml Two or more words are said to be anagrams if they have the same characters, but in a different order. By analogy with derangements we define a deranged anagram as two words with the same characters, but in which the same character does not appear in the same position in both words. Task...

christopher/rosetta-code

http://rosettacode.org/wiki/Fusc_sequence

Fusc sequence

Definitions The fusc integer sequence is defined as: fusc(0) = 0 fusc(1) = 1 for n>1, the nth term is defined as: if n is even; fusc(n) = fusc(n/2) if n is odd; fusc(n) = fusc((n-1)/2) + fusc((n+1)/2) Note that MathWorld's definition starts with unity, not zero. Th...

#Visual_Basic_.NET

Visual Basic .NET

Module Module1 Dim n As Integer = 61, l As List(Of Integer) = {0, 1}.ToList Function fusc(n As Integer) As Integer If n < l.Count Then Return l(n) fusc = If((n And 1) = 0, l(n >> 1), l((n - 1) >> 1) + l((n + 1) >> 1)) l.Add(fusc) End Function Sub Main(args As String()) ...

Give a code snippet in #Visual_Basic_.NET Definitions The fusc integer sequence is defined as: fusc(0) = 0 fusc(1) = 1 for n>1, the nth term is defined as: if n is even; fusc(n) = fusc(n/2) if n is odd; fusc(n) = fusc((n-1)/2) + fusc((n+1)/2) Note that MathWorld's d...

christopher/rosetta-code

http://rosettacode.org/wiki/Determine_if_a_string_is_numeric

Determine if a string is numeric

Task Create a boolean function which takes in a string and tells whether it is a numeric string (floating point and negative numbers included) in the syntax the language uses for numeric literals or numbers converted from strings. Other tasks related to string operations: Metrics Array length String length Cop...

#Euphoria

Euphoria

include get.e function is_numeric(sequence s) sequence val val = value(s) return val[1]=GET_SUCCESS and atom(val[2]) end function

Give a code snippet in #Euphoria Task Create a boolean function which takes in a string and tells whether it is a numeric string (floating point and negative numbers included) in the syntax the language uses for numeric literals or numbers converted from strings. Other tasks related to string operations: Metrics...

christopher/rosetta-code

http://rosettacode.org/wiki/Command-line_arguments

Command-line arguments

Command-line arguments is part of Short Circuit's Console Program Basics selection. Scripted main See also Program name. For parsing command line arguments intelligently, see Parsing command-line arguments. Example command line: myprogram -c "alpha beta" -h "gamma"

#CLU

CLU

% This program needs to be merged with PCLU's "useful.lib", % where get_argv lives. % % pclu -merge $CLUHOME/lib/useful.lib -compile cmdline.clu start_up = proc () po: stream := stream$primary_output() args: sequence[string] := get_argv() for arg: string in sequence[string]$elements(args) do s...

Give a code snippet in #CLU Command-line arguments is part of Short Circuit's Console Program Basics selection. Scripted main See also Program name. For parsing command line arguments intelligently, see Parsing command-line arguments. Example command line: myprogram -c "alpha beta" -h "gamma"

christopher/rosetta-code

http://rosettacode.org/wiki/Find_limit_of_recursion

Find limit of recursion

Find limit of recursion is part of Short Circuit's Console Program Basics selection. Task Find the limit of recursion.

#VBScript

VBScript

'mung.vbs option explicit dim c if wscript.arguments.count = 1 then c = wscript.arguments(0) c = c + 1 else c = 0 end if wscript.echo "[Depth",c & "] Mung until no good." CreateObject("WScript.Shell").Run "cscript Mung.vbs " & c, 1, true wscript.echo "[Depth",c & "] no good."

Give a code snippet in #VBScript Find limit of recursion is part of Short Circuit's Console Program Basics selection. Task Find the limit of recursion.

christopher/rosetta-code

http://rosettacode.org/wiki/Odd_word_problem

Odd word problem

Task Write a program that solves the odd word problem with the restrictions given below. Description You are promised an input stream consisting of English letters and punctuations. It is guaranteed that: the words (sequence of consecutive letters) are delimited by one and only one punctuation, the stream will...

#Sidef

Sidef

func rev { (var c = STDIN.getc) \\ return() if (c ~~ /^[a-z]\z/i) { var r = rev() print c return r } return c } var (n=0, l=false) while (defined(var c = STDIN.getc)) { var w = (c ~~ /^[a-z]\z/i) ++n if (w && !l) l = w if (n & 1) { print c } else { ...

Give a code snippet in #Sidef Task Write a program that solves the odd word problem with the restrictions given below. Description You are promised an input stream consisting of English letters and punctuations. It is guaranteed that: the words (sequence of consecutive letters) are delimited by one and only on...

christopher/rosetta-code

http://rosettacode.org/wiki/Extensible_prime_generator

Extensible prime generator

Task Write a generator of prime numbers, in order, that will automatically adjust to accommodate the generation of any reasonably high prime. The routine should demonstrably rely on either: Being based on an open-ended counter set to count without upper limit other than system or programming language limits. In thi...

#PureBasic

PureBasic

EnableExplicit DisableDebugger Define StartTime.i=ElapsedMilliseconds() Procedure.b IsPrime(n.i) Define i.i=5 If n<2 : ProcedureReturn #False : EndIf If n%2=0 : ProcedureReturn Bool(n=2) : EndIf If n%3=0 : ProcedureReturn Bool(n=3) : EndIf While i*i<=n If n%i=0 : ProcedureReturn #False : EndIf i+2 ...

Give a code snippet in #PureBasic Task Write a generator of prime numbers, in order, that will automatically adjust to accommodate the generation of any reasonably high prime. The routine should demonstrably rely on either: Being based on an open-ended counter set to count without upper limit other than system or ...

christopher/rosetta-code

http://rosettacode.org/wiki/Long_literals,_with_continuations

Long literals, with continuations

This task is about writing a computer program that has long literals (character literals that may require specifying the words/tokens on more than one (source) line, either with continuations or some other method, such as abutments or concatenations (or some other mechanisms). The literal is to be in the form ...

#Pascal

Pascal

#!/usr/bin/perl use strict; # https://rosettacode.org/wiki/Long_literals,_with_continuations use warnings; my $longliteral = join ' ', split ' ', <<END; hydrogen helium lithium beryllium boron carbon nitrogen oxygen fluorine neon sodium magnesium aluminum silicon phosphorous sulfur chlorine argon potassium calcium ...

Give a code snippet in #Pascal This task is about writing a computer program that has long literals (character literals that may require specifying the words/tokens on more than one (source) line, either with continuations or some other method, such as abutments or concatenations (or some other mechanisms). T...

christopher/rosetta-code

http://rosettacode.org/wiki/Find_the_intersection_of_a_line_with_a_plane

Find the intersection of a line with a plane

Finding the intersection of an infinite ray with a plane in 3D is an important topic in collision detection. Task Find the point of intersection for the infinite ray with direction (0, -1, -1) passing through position (0, 0, 10) with the infinite plane with a normal vector of (0, 0, 1) and which passes ...

#Groovy

Groovy

class LinePlaneIntersection { private static class Vector3D { private double x, y, z Vector3D(double x, double y, double z) { this.x = x this.y = y this.z = z } Vector3D plus(Vector3D v) { return new Vector3D(x + v.x, y + v.y, z + v...

Give a code snippet in #Groovy Finding the intersection of an infinite ray with a plane in 3D is an important topic in collision detection. Task Find the point of intersection for the infinite ray with direction (0, -1, -1) passing through position (0, 0, 10) with the infinite plane with a normal vector of...

christopher/rosetta-code

http://rosettacode.org/wiki/Iterated_digits_squaring

Iterated digits squaring

If you add the square of the digits of a Natural number (an integer bigger than zero), you always end with either 1 or 89: 15 -> 26 -> 40 -> 16 -> 37 -> 58 -> 89 7 -> 49 -> 97 -> 130 -> 10 -> 1 An example in Python: >>> step = lambda x: sum(int(d) ** 2 for d in str(x)) >>> iterate = lambda x: x if x in [1, 89] else i...

#C.23

C#

using System; public static class IteratedDigitsSquaring { public static void Main() { Console.WriteLine(Count89s(1_000_000)); Console.WriteLine(Count89s(100_000_000)); } public static int Count89s(int limit) { if (limit < 1) return 0; int[] end = new int[Math.Min(limit, 9 ...

Give a code snippet in #C.23 If you add the square of the digits of a Natural number (an integer bigger than zero), you always end with either 1 or 89: 15 -> 26 -> 40 -> 16 -> 37 -> 58 -> 89 7 -> 49 -> 97 -> 130 -> 10 -> 1 An example in Python: >>> step = lambda x: sum(int(d) ** 2 for d in str(x)) >>> iterate = lamb...

christopher/rosetta-code

http://rosettacode.org/wiki/Koch_curve

Koch curve

Draw a Koch curve. See details: Koch curve

#Nim

Nim

from math import sin, cos, PI import libgd const width = 512 height = 512 iterations = 4 proc kochCurve(img: gdImagePtr, x1, y1, x2, y2: float, iter: int): void = let angle = PI / 3 # 60 degrees let x3 = (x1 * 2 + x2) / 3 let y3 = (y1 * 2 + y2) / 3 let x4 = (x1 + x2 * 2) / 3 let y4 = (y1 + y2 * 2...

Give a code snippet in #Nim Draw a Koch curve. See details: Koch curve

christopher/rosetta-code

http://rosettacode.org/wiki/24_game

24 game

The 24 Game tests one's mental arithmetic. Task Write a program that randomly chooses and displays four digits, each from 1 ──► 9 (inclusive) with repetitions allowed. The program should prompt for the player to enter an arithmetic expression using just those, and all of those four digits, used exactly once each. T...

#Picat

Picat

import util. main => play. play => nl, Digits = [random() mod 9 + 1 : _ in 1..4].sort(), println("Enter \"q\" to quit"), println("Enter \"!\" to request a new set of four digits."), printf("Or enter expression using %w => ", Digits), Exp = read_line().strip(), evaluate(Digits,Exp). ...

Give a code snippet in #Picat The 24 Game tests one's mental arithmetic. Task Write a program that randomly chooses and displays four digits, each from 1 ──► 9 (inclusive) with repetitions allowed. The program should prompt for the player to enter an arithmetic expression using just those, and all of those four di...

christopher/rosetta-code

http://rosettacode.org/wiki/Factorial

Factorial

Definitions The factorial of 0 (zero) is defined as being 1 (unity). The Factorial Function of a positive integer, n, is defined as the product of the sequence: n, n-1, n-2, ... 1 Task Write a function to return the factorial of a number. Solutions can be iterat...

#.D0.9C.D0.9A-61.2F52

МК-61/52

ВП П0 1 ИП0 * L0 03 С/П

Give a code snippet in #.D0.9C.D0.9A-61.2F52 Definitions The factorial of 0 (zero) is defined as being 1 (unity). The Factorial Function of a positive integer, n, is defined as the product of the sequence: n, n-1, n-2, ... 1 Task Write a function to return the f...

christopher/rosetta-code

http://rosettacode.org/wiki/Higher-order_functions

Higher-order functions

Task Pass a function as an argument to another function. Related task First-class functions

#Oforth

Oforth

[1, 2, 3, 4, 5 ] map(#1+)

Give a code snippet in #Oforth Task Pass a function as an argument to another function. Related task First-class functions

christopher/rosetta-code

http://rosettacode.org/wiki/Copy_a_string

Copy a string

This task is about copying a string. Task Where it is relevant, distinguish between copying the contents of a string versus making an additional reference to an existing string. Other tasks related to string operations: Metrics Array length String length Copy a string Empty string (assignment) Counting W...

#Batch_File

Batch File

set src=Hello set dst=%src%

Give a code snippet in #Batch_File This task is about copying a string. Task Where it is relevant, distinguish between copying the contents of a string versus making an additional reference to an existing string. Other tasks related to string operations: Metrics Array length String length Copy a string Em...

christopher/rosetta-code

http://rosettacode.org/wiki/Averages/Root_mean_square

Averages/Root mean square

Task[edit] Compute the Root mean square of the numbers 1..10. The root mean square is also known by its initials RMS (or rms), and as the quadratic mean. The RMS is calculated as the mean of the squares of the numbers, square-rooted: x r m s = x 1 2 + x 2 2 + ⋯ + x ...

#Ada

Ada

with Ada.Float_Text_IO; use Ada.Float_Text_IO; with Ada.Numerics.Elementary_Functions; use Ada.Numerics.Elementary_Functions; procedure calcrms is type float_arr is array(1..10) of Float; function rms(nums : float_arr) return Float is sum : Float := 0.0; begin for p in nums'Range loop sum := sum + nums(p)*...

Give a code snippet in #Ada Task[edit] Compute the Root mean square of the numbers 1..10. The root mean square is also known by its initials RMS (or rms), and as the quadratic mean. The RMS is calculated as the mean of the squares of the numbers, square-rooted: x r m s = x 1 2 +...

christopher/rosetta-code

http://rosettacode.org/wiki/99_bottles_of_beer

99 bottles of beer

Task Display the complete lyrics for the song: 99 Bottles of Beer on the Wall. The beer song The lyrics follow this form: 99 bottles of beer on the wall 99 bottles of beer Take one down, pass it around 98 bottles of beer on the wall 98 bottles of beer on the wall 98 bottles of beer Take one dow...

#IDL

IDL

Pro bottles for i=1,99 do begin print, 100-i, " bottles of beer on the wall.", 100-i, $ " bottles of beer.", " Take one down, pass it around," , $ 99-i, " bottles of beer on the wall." endfor End

Give a code snippet in #IDL Task Display the complete lyrics for the song: 99 Bottles of Beer on the Wall. The beer song The lyrics follow this form: 99 bottles of beer on the wall 99 bottles of beer Take one down, pass it around 98 bottles of beer on the wall 98 bottles of beer on the wall 98 b...

christopher/rosetta-code

http://rosettacode.org/wiki/Box_the_compass

Box the compass

There be many a land lubber that knows naught of the pirate ways and gives direction by degree! They know not how to box the compass! Task description Create a function that takes a heading in degrees and returns the correct 32-point compass heading. Use the function to print and display a table of Index, Compass...

#PowerShell

PowerShell

function Convert-DegreeToDirection ( [double]$Degree ) { $Directions = @( 'n','n by e','n-ne','ne by n','ne','ne by e','e-ne','e by n', 'e','e by s','e-se','se by e','se','se by s','s-se','s by e', 's','s by w','s-sw','sw by s','sw','sw by w','w-sw','w by s',...

Give a code snippet in #PowerShell There be many a land lubber that knows naught of the pirate ways and gives direction by degree! They know not how to box the compass! Task description Create a function that takes a heading in degrees and returns the correct 32-point compass heading. Use the function to print a...

christopher/rosetta-code

http://rosettacode.org/wiki/Babbage_problem

Babbage problem

Charles Babbage, looking ahead to the sorts of problems his Analytical Engine would be able to solve, gave this example: What is the smallest positive integer whose square ends in the digits 269,696? — Babbage, letter to Lord Bowden, 1837; see Hollingdale and Tootill, Electronic Computers, second edition, 1970, p....

#FreeBASIC

FreeBASIC

' version 25-10-2016 ' compile with: fbc -s console ' Charles Babbage would have known that only number ending ' on a 4 or 6 could produce a square ending on a 6 ' also any number below 520 would produce a square smaller than 269,696 ' we can stop when we have reached 99,736 ' we know it square and it ends on 269,696...

Give a code snippet in #FreeBASIC Charles Babbage, looking ahead to the sorts of problems his Analytical Engine would be able to solve, gave this example: What is the smallest positive integer whose square ends in the digits 269,696? — Babbage, letter to Lord Bowden, 1837; see Hollingdale and Tootill, Electronic ...

christopher/rosetta-code

http://rosettacode.org/wiki/Greatest_element_of_a_list

Greatest element of a list

Task Create a function that returns the maximum value in a provided set of values, where the number of values may not be known until run-time.

#RapidQ

RapidQ

functioni FindMax(...) as double dim x as integer for x = 1 to ParamValCount IF ParamVal(x) > Result THEN Result = ParamVal(x) next End functioni Print FindMax(50, 20, 65, 20, 105)

Give a code snippet in #RapidQ Task Create a function that returns the maximum value in a provided set of values, where the number of values may not be known until run-time.

christopher/rosetta-code

http://rosettacode.org/wiki/Function_composition

Function composition

Task Create a function, compose, whose two arguments f and g, are both functions with one argument. The result of compose is to be a function of one argument, (lets call the argument x), which works like applying function f to the result of applying function g to x. Example compose...

#Raku

Raku

sub triple($n) { 3 * $n } my &f = &triple ∘ &prefix:<-> ∘ { $^n + 2 }; say &f(5); # prints "-21".

Give a code snippet in #Raku Task Create a function, compose, whose two arguments f and g, are both functions with one argument. The result of compose is to be a function of one argument, (lets call the argument x), which works like applying function f to the result of applying function g ...

christopher/rosetta-code

http://rosettacode.org/wiki/Return_multiple_values

Return multiple values

Task Show how to return more than one value from a function.

#Standard_ML

Standard ML

fun addsub (x, y) = (x + y, x - y)

Give a code snippet in #Standard_ML Task Show how to return more than one value from a function.

christopher/rosetta-code

http://rosettacode.org/wiki/Pangram_checker

Pangram checker

Pangram checker You are encouraged to solve this task according to the task description, using any language you may know. A pangram is a sentence that contains all the letters of the English alphabet at least once. For example: The quick brown fox jumps over the lazy dog. Task Write a function or method to chec...

#Excel

Excel

ISPANGRAM =LAMBDA(s, LET( abc, CHARS(LOWER("abcdefghijklmnopqrstuvwxyz")), AND( LAMBDA(c, ISNUMBER(SEARCH(c, s, 1)) )( abc ) ) ) )

Give a code snippet in #Excel Pangram checker You are encouraged to solve this task according to the task description, using any language you may know. A pangram is a sentence that contains all the letters of the English alphabet at least once. For example: The quick brown fox jumps over the lazy dog. Task Wri...

christopher/rosetta-code

http://rosettacode.org/wiki/Delete_a_file

Delete a file

Task Delete a file called "input.txt" and delete a directory called "docs". This should be done twice: once "here", i.e. in the current working directory and once in the filesystem root.

#Pike

Pike

int main(){ rm("input.txt"); rm("/input.txt"); rm("docs"); rm("/docs"); }

Give a code snippet in #Pike Task Delete a file called "input.txt" and delete a directory called "docs". This should be done twice: once "here", i.e. in the current working directory and once in the filesystem root.

christopher/rosetta-code

http://rosettacode.org/wiki/Hello_world/Line_printer

Hello world/Line printer

Task Cause a line printer attached to the computer to print a line containing the message: Hello World! Note A line printer is not the same as standard output. A line printer was an older-style printer which prints one line at a time to a continuous ream of paper. With some systems, a line printer can be...

#Swift

Swift

import Foundation let out = NSOutputStream(toFileAtPath: "/dev/lp0", append: true) let data = "Hello, World!".dataUsingEncoding(NSUTF8StringEncoding, allowLossyConversion: false) out?.open() out?.write(UnsafePointer<UInt8>(data!.bytes), maxLength: data!.length) out?.close()

Give a code snippet in #Swift Task Cause a line printer attached to the computer to print a line containing the message: Hello World! Note A line printer is not the same as standard output. A line printer was an older-style printer which prints one line at a time to a continuous ream of paper. With some...

christopher/rosetta-code

http://rosettacode.org/wiki/ABC_problem

ABC problem

ABC problem You are encouraged to solve this task according to the task description, using any language you may know. You are given a collection of ABC blocks (maybe like the ones you had when you were a kid). There are twenty blocks with two letters on each block. A complete alphabet is guaranteed amongst all sid...

#Gambas

Gambas

Public Sub Main() Dim sCheck As String[] = ["A", "BARK", "BOOK", "TREAT", "COMMON", "SQUAD", "CONFUSE"] Dim sBlock As String[] = ["BO", "XK", "DQ", "CP", "NA", "GT", "RE", "TG", "QD", "FS", "JW", "HU", "VI", "AN", "OB", "ER", "FS", "LY", "PC", "ZM"] Dim sList As New String[] Dim siCount, siLoop As Short Dim sTemp, sAns...

Give a code snippet in #Gambas ABC problem You are encouraged to solve this task according to the task description, using any language you may know. You are given a collection of ABC blocks (maybe like the ones you had when you were a kid). There are twenty blocks with two letters on each block. A complete alphab...

christopher/rosetta-code

http://rosettacode.org/wiki/Run-length_encoding

Run-length encoding

Run-length encoding You are encouraged to solve this task according to the task description, using any language you may know. Task Given a string containing uppercase characters (A-Z), compress repeated 'runs' of the same character by storing the length of that run, and provide a function to reverse the compression...

#AWK

AWK

BEGIN { FS="" } /^[^0-9]+$/ { cp = $1; j = 0 for(i=1; i <= NF; i++) { if ( $i == cp ) { j++; } else { printf("%d%c", j, cp) j = 1 } cp = $i } printf("%d%c", j, cp) }

Give a code snippet in #AWK Run-length encoding You are encouraged to solve this task according to the task description, using any language you may know. Task Given a string containing uppercase characters (A-Z), compress repeated 'runs' of the same character by storing the length of that run, and provide a functi...

christopher/rosetta-code

http://rosettacode.org/wiki/Extreme_floating_point_values

Extreme floating point values

The IEEE floating point specification defines certain 'extreme' floating point values such as minus zero, -0.0, a value distinct from plus zero; not a number, NaN; and plus and minus infinity. The task is to use expressions involving other 'normal' floating point values in your language to calculate these, (and maybe ...

#jq

jq

0/0 #=> null 1e1000 #=> 1.7976931348623157e+308

Give a code snippet in #jq The IEEE floating point specification defines certain 'extreme' floating point values such as minus zero, -0.0, a value distinct from plus zero; not a number, NaN; and plus and minus infinity. The task is to use expressions involving other 'normal' floating point values in your language to ...

christopher/rosetta-code

http://rosettacode.org/wiki/Digital_root

Digital root

The digital root, X {\displaystyle X} , of a number, n {\displaystyle n} , is calculated: find X {\displaystyle X} as the sum of the digits of n {\displaystyle n} find a new X {\displaystyle X} by summing the digits of X {\displaystyle X} , repeating until X {\displ...

#ZX_Spectrum_Basic

ZX Spectrum Basic

10 DATA 4,627615,39390,588225,9992 20 READ j: LET b=10 30 FOR i=1 TO j 40 READ n 50 PRINT "Digital root of ";n;" is" 60 GO SUB 1000 70 NEXT i 80 STOP 1000 REM Digital Root 1010 LET c=0 1020 IF n>=b THEN LET c=c+1: GO SUB 2000: GO TO 1020 1030 PRINT n;" persistance is ";c'' 1040 RETURN 2000 REM Digit sum 2010 LET s=0 ...

Give a code snippet in #ZX_Spectrum_Basic The digital root, X {\displaystyle X} , of a number, n {\displaystyle n} , is calculated: find X {\displaystyle X} as the sum of the digits of n {\displaystyle n} find a new X {\displaystyle X} by summing the digits of X {\display...

christopher/rosetta-code

http://rosettacode.org/wiki/Dijkstra%27s_algorithm

Dijkstra's algorithm

This task has been clarified. Its programming examples are in need of review to ensure that they still fit the requirements of the task. Dijkstra's algorithm, conceived by Dutch computer scientist Edsger Dijkstra in 1956 and published in 1959, is a graph search algorithm that solves the single-source shortest path pro...

#SAS

SAS

/* create SAS data set */ data Edges; input Start $ End $ Cost; datalines; a b 7 a c 9 a f 14 b c 10 b d 15 c d 11 c f 2 d e 6 e f 9 ; /* call OPTMODEL procedure in SAS/OR */ proc optmodel; /* declare sets and parameters, and read input data */ set <str,str> LINKS; ...

Give a code snippet in #SAS This task has been clarified. Its programming examples are in need of review to ensure that they still fit the requirements of the task. Dijkstra's algorithm, conceived by Dutch computer scientist Edsger Dijkstra in 1956 and published in 1959, is a graph search algorithm that solves the si...

christopher/rosetta-code

http://rosettacode.org/wiki/Hello_world/Newline_omission

Hello world/Newline omission

Some languages automatically insert a newline after outputting a string, unless measures are taken to prevent its output. Task Display the string Goodbye, World! without a trailing newline. Related tasks Hello world/Graphical Hello world/Line Printer Hello world/Standard error Hello world/Text

#REXX

REXX

/*REXX pgm displays a "Goodbye, World!" without a trailing newline. */ call charout ,'Goodbye, World!'

Give a code snippet in #REXX Some languages automatically insert a newline after outputting a string, unless measures are taken to prevent its output. Task Display the string Goodbye, World! without a trailing newline. Related tasks Hello world/Graphical Hello world/Line Printer Hello world/Standa...

christopher/rosetta-code

http://rosettacode.org/wiki/Multi-dimensional_array

Multi-dimensional array

For the purposes of this task, the actual memory layout or access method of this data structure is not mandated. It is enough to: State the number and extent of each index to the array. Provide specific, ordered, integer indices for all dimensions of the array together with a new value to update the indexed value. ...

#Klingphix

Klingphix

include ..\Utilitys.tlhy 0 ( 4 3 2 ) dim pstack 5432 ( 4 3 2 ) set pstack ( 4 3 2 ) get ? ( 4 3 ) get %row !row $row ? $row 1 2 set !row $row ? $row ( 4 3 ) set 0 4 repeat ( 4 2 ) set pstack "End " input

Give a code snippet in #Klingphix For the purposes of this task, the actual memory layout or access method of this data structure is not mandated. It is enough to: State the number and extent of each index to the array. Provide specific, ordered, integer indices for all dimensions of the array together with a new ...

christopher/rosetta-code

http://rosettacode.org/wiki/Deconvolution/1D

Deconvolution/1D

The convolution of two functions F {\displaystyle {\mathit {F}}} and H {\displaystyle {\mathit {H}}} of an integer variable is defined as the function G {\displaystyle {\mathit {G}}} satisfying G ( n ) = ∑ m = − ∞ ∞ F ( m ) H ( n − m ) {\displaystyle G(n)=\sum _{m=-\inft...

#BBC_BASIC

BBC BASIC

*FLOAT 64 DIM h(5), f(15), g(20) h() = -8,-9,-3,-1,-6,7 f() = -3,-6,-1,8,-6,3,-1,-9,-9,3,-2,5,2,-2,-7,-1 g() = 24,75,71,-34,3,22,-45,23,245,25,52,25,-67,-96,96,31,55,36,29,-43,-7 PROCdeconv(g(), f(), x()) PRINT "deconv(g,f) = " FNprintarray(x()) x() -= h() : IF SUM(x())...

Give a code snippet in #BBC_BASIC The convolution of two functions F {\displaystyle {\mathit {F}}} and H {\displaystyle {\mathit {H}}} of an integer variable is defined as the function G {\displaystyle {\mathit {G}}} satisfying G ( n ) = ∑ m = − ∞ ∞ F ( m ) H ( n − m ) ...

christopher/rosetta-code

http://rosettacode.org/wiki/Y_combinator

Y combinator

In strict functional programming and the lambda calculus, functions (lambda expressions) don't have state and are only allowed to refer to arguments of enclosing functions. This rules out the usual definition of a recursive function wherein a function is associated with the state of a variable and this variable's stat...

#Wren

Wren

var y = Fn.new { |f| var g = Fn.new { |r| f.call { |x| r.call(r).call(x) } } return g.call(g) } var almostFac = Fn.new { |f| Fn.new { |x| x <= 1 ? 1 : x * f.call(x-1) } } var almostFib = Fn.new { |f| Fn.new { |x| x <= 2 ? 1 : f.call(x-1) + f.call(x-2) } } var fac = y.call(almostFac) var fib = y.call(almos...

Give a code snippet in #Wren In strict functional programming and the lambda calculus, functions (lambda expressions) don't have state and are only allowed to refer to arguments of enclosing functions. This rules out the usual definition of a recursive function wherein a function is associated with the state of a var...

christopher/rosetta-code

http://rosettacode.org/wiki/MD5

MD5

Task Encode a string using an MD5 algorithm. The algorithm can be found on Wikipedia. Optionally, validate your implementation by running all of the test values in IETF RFC (1321) for MD5. Additionally, RFC 1321 provides more precise information on the algorithm than the Wikipedia article. Warning:...

#J

J

require 'convert/misc/md5' md5 'The quick brown fox jumped over the lazy dog''s back' e38ca1d920c4b8b8d3946b2c72f01680

Give a code snippet in #J Task Encode a string using an MD5 algorithm. The algorithm can be found on Wikipedia. Optionally, validate your implementation by running all of the test values in IETF RFC (1321) for MD5. Additionally, RFC 1321 provides more precise information on the algorithm than the Wiki...

christopher/rosetta-code

http://rosettacode.org/wiki/CRC-32

CRC-32

Task Demonstrate a method of deriving the Cyclic Redundancy Check from within the language. The result should be in accordance with ISO 3309, ITU-T V.42, Gzip and PNG. Algorithms are described on Computation of CRC in Wikipedia. This variant of CRC-32 uses LSB-first order, sets the initial CRC to FFFFFFFF16, and...

#Java

Java

import java.util.zip.* ; public class CRCMaker { public static void main( String[ ] args ) { String toBeEncoded = new String( "The quick brown fox jumps over the lazy dog" ) ; CRC32 myCRC = new CRC32( ) ; myCRC.update( toBeEncoded.getBytes( ) ) ; System.out.println( "The CRC-32 value is : "...

Give a code snippet in #Java Task Demonstrate a method of deriving the Cyclic Redundancy Check from within the language. The result should be in accordance with ISO 3309, ITU-T V.42, Gzip and PNG. Algorithms are described on Computation of CRC in Wikipedia. This variant of CRC-32 uses LSB-first order, sets the ...

christopher/rosetta-code

http://rosettacode.org/wiki/Pascal%27s_triangle

Pascal's triangle

Pascal's triangle is an arithmetic and geometric figure often associated with the name of Blaise Pascal, but also studied centuries earlier in India, Persia, China and elsewhere. Its first few rows look like this: 1 1 1 1 2 1 1 3 3 1 where each element of each row is either 1 or the sum of the two elemen...

#Lua

Lua

function nextrow(t) local ret = {} t[0], t[#t+1] = 0, 0 for i = 1, #t do ret[i] = t[i-1] + t[i] end return ret end function triangle(n) t = {1} for i = 1, n do print(unpack(t)) t = nextrow(t) end end

Give a code snippet in #Lua Pascal's triangle is an arithmetic and geometric figure often associated with the name of Blaise Pascal, but also studied centuries earlier in India, Persia, China and elsewhere. Its first few rows look like this: 1 1 1 1 2 1 1 3 3 1 where each element of each row is either 1...

christopher/rosetta-code

http://rosettacode.org/wiki/Zero_to_the_zero_power

Zero to the zero power

Some computer programming languages are not exactly consistent (with other computer programming languages) when raising zero to the zeroth power: 00 Task Show the results of raising zero to the zeroth power. If your computer language objects to 0**0 or 0^0 at compile time, ...

#Nim

Nim

import math echo pow(0.0, 0.0) # Floating point exponentiation. echo 0 ^ 0 # Integer exponentiation.

Give a code snippet in #Nim Some computer programming languages are not exactly consistent (with other computer programming languages) when raising zero to the zeroth power: 00 Task Show the results of raising zero to the zeroth power. If your computer language objects to 0**0 or ...

christopher/rosetta-code

http://rosettacode.org/wiki/Permutations/Derangements

Permutations/Derangements

A derangement is a permutation of the order of distinct items in which no item appears in its original place. For example, the only two derangements of the three items (0, 1, 2) are (1, 2, 0), and (2, 0, 1). The number of derangements of n distinct items is known as the subfactorial of n, sometimes written as !n. The...

#PicoLisp

PicoLisp

(load "@lib/simul.l") # For 'permute' (de derangements (Lst) (filter '((L) (not (find = L Lst))) (permute Lst) ) ) (de subfact (N) (if (>= 2 N) (if (= 1 N) 0 1) (* (dec N) (+ (subfact (dec N)) (subfact (- N 2))) ) ) )

Give a code snippet in #PicoLisp A derangement is a permutation of the order of distinct items in which no item appears in its original place. For example, the only two derangements of the three items (0, 1, 2) are (1, 2, 0), and (2, 0, 1). The number of derangements of n distinct items is known as the subfactorial ...

christopher/rosetta-code

http://rosettacode.org/wiki/Identity_matrix

Identity matrix

Task Build an identity matrix of a size known at run-time. An identity matrix is a square matrix of size n × n, where the diagonal elements are all 1s (ones), and all the other elements are all 0s (zeroes). I n = [ 1 0 0 ⋯ 0 0 1 0 ⋯ 0 0 0 1 ⋯ 0 ⋮ ⋮ ⋮ ⋱ ...

#Frink

Frink

n = parseInt[input["Enter matrix dimension as an integer: "]] println[formatMatrix[makeArray[[n, n], {|a,b| a==b ? 1 : 0}]]]

Give a code snippet in #Frink Task Build an identity matrix of a size known at run-time. An identity matrix is a square matrix of size n × n, where the diagonal elements are all 1s (ones), and all the other elements are all 0s (zeroes). I n = [ 1 0 0 ⋯ 0 0 1 0 ⋯ 0 0 0...

christopher/rosetta-code

http://rosettacode.org/wiki/Currying

Currying

This page uses content from Wikipedia. The original article was at Currying. The list of authors can be seen in the page history. As with Rosetta Code, the text of Wikipedia is available under the GNU FDL. (See links for details on variance) Task Create a simple demonstrative example of Currying in a specific la...

#Vala

Vala

delegate double Dbl_Op(double d); Dbl_Op curried_add(double a) { return (b) => a + b; } void main() { print(@"$(curried_add(3.0)(4.0))\n"); double sum2 = curried_add(2.0) (curried_add(3.0)(4.0)); //sum2 = 9 print(@"$sum2\n"); }

Give a code snippet in #Vala This page uses content from Wikipedia. The original article was at Currying. The list of authors can be seen in the page history. As with Rosetta Code, the text of Wikipedia is available under the GNU FDL. (See links for details on variance) Task Create a simple demonstrative exampl...

christopher/rosetta-code

http://rosettacode.org/wiki/Exponentiation_operator

Exponentiation operator

Most programming languages have a built-in implementation of exponentiation. Task Re-implement integer exponentiation for both intint and floatint as both a procedure, and an operator (if your language supports operator definition). If the language supports operator (or procedure) overloading, then an ov...

#Erlang

Erlang

pow(X, Y) when Y < 0 -> 1/pow(X, -Y); pow(X, Y) when is_integer(Y) -> pow(X, Y, 1). pow(_, 0, B) -> B; pow(X, Y, B) -> B2 = if Y rem 2 =:= 0 -> B; true -> X * B end, pow(X * X, Y div 2, B2).

Give a code snippet in #Erlang Most programming languages have a built-in implementation of exponentiation. Task Re-implement integer exponentiation for both intint and floatint as both a procedure, and an operator (if your language supports operator definition). If the language supports operator (or pr...

christopher/rosetta-code

http://rosettacode.org/wiki/Gamma_function

Gamma function

Task Implement one algorithm (or more) to compute the Gamma ( Γ {\displaystyle \Gamma } ) function (in the real field only). If your language has the function as built-in or you know a library which has it, compare your implementation's results with the results of the built-in/library function. The Gamma funct...

#Arturo

Arturo

A: @[ 1.00000000000000000000 0.57721566490153286061 neg 0.65587807152025388108 neg 0.04200263503409523553 0.16653861138229148950 neg 0.04219773455554433675 neg 0.00962197152787697356 0.00721894324666309954 neg 0.00116516759185906511 neg 0.00021524167411495097 0.00012805028238811619 neg 0.00002013485...

Give a code snippet in #Arturo Task Implement one algorithm (or more) to compute the Gamma ( Γ {\displaystyle \Gamma } ) function (in the real field only). If your language has the function as built-in or you know a library which has it, compare your implementation's results with the results of the built-in/li...

christopher/rosetta-code

http://rosettacode.org/wiki/List_rooted_trees

List rooted trees

You came back from grocery shopping. After putting away all the goods, you are left with a pile of plastic bags, which you want to save for later use, so you take one bag and stuff all the others into it, and throw it under the sink. In doing so, you realize that there are various ways of nesting the bags, with all...

#Sidef

Sidef

func bagchain(x, n, bb, start=0) { n || return [x] var out = [] for i in (start .. bb.end) { var (c, s) = bb[i]... if (c <= n) { out += bagchain([x[0] + c, x[1] + s], n-c, bb, i) } } return out } func bags(n) { n || return [[0, ""]] var upto = [] ...

Give a code snippet in #Sidef You came back from grocery shopping. After putting away all the goods, you are left with a pile of plastic bags, which you want to save for later use, so you take one bag and stuff all the others into it, and throw it under the sink. In doing so, you realize that there are various way...

christopher/rosetta-code