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/FASTA_format	FASTA format	In bioinformatics, long character strings are often encoded in a format called FASTA. A FASTA file can contain several strings, each identified by a name marked by a > (greater than) character at the beginning of the line. Task Write a program that reads a FASTA file such as: >Rosetta_Example_1 THERECANBENOSPACE ...	#Action.21	Action!	PROC ReadFastaFile(CHAR ARRAY fname) CHAR ARRAY line(256) CHAR ARRAY tmp(256) BYTE newLine,dev=[1] newLine=0 Close(dev) Open(dev,fname,4) WHILE Eof(dev)=0 DO InputSD(dev,line) IF line(0)>0 AND line(1)='> THEN IF newLine THEN PutE() FI newLine=1 SCopyS(tmp,line,2...	Give a code snippet in #Action.21 In bioinformatics, long character strings are often encoded in a format called FASTA. A FASTA file can contain several strings, each identified by a name marked by a > (greater than) character at the beginning of the line. Task Write a program that reads a FASTA file such as: >R...	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, ...	#Bc	Bc	0 ^ 0	Give a code snippet in #Bc 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/Largest_number_divisible_by_its_digits	Largest number divisible by its digits	Task Find the largest base 10 integer whose digits are all different, and is evenly divisible by each of its individual digits. These numbers are also known as Lynch-Bell numbers, numbers n such that the (base ten) digits are all different (and do not include zero) and n is divisible by each of it...	#AWK	AWK	# Usage: gawk -f LARGEST_NUMBER_DIVISIBLE_BY_ITS_DIGITS_10.AWK BEGIN { base = 10 comdiv = 12 startn = 9876543 stopn = 1000000 solve(startn, stopn) } function solve(startn, stopn, n, d) { for (n = startn - startn % comdiv; n > stopn; n -= comdiv) { if (hasuniqedigits(n)) { ...	Give a code snippet in #AWK Task Find the largest base 10 integer whose digits are all different, and is evenly divisible by each of its individual digits. These numbers are also known as Lynch-Bell numbers, numbers n such that the (base ten) digits are all different (and do not include zero) and n...	christopher/rosetta-code
http://rosettacode.org/wiki/Fermat_numbers	Fermat numbers	In mathematics, a Fermat number, named after Pierre de Fermat who first studied them, is a positive integer of the form Fn = 22n + 1 where n is a non-negative integer. Despite the simplicity of generating Fermat numbers, they have some powerful mathematical properties and are extensively used in cryptography & pseudo-...	#Python	Python	def factors(x): factors = [] i = 2 s = int(x 0.5) while i < s: if x % i == 0: factors.append(i) x = int(x / i) s = int(x 0.5) i += 1 factors.append(x) return factors print("First 10 Fermat numbers:") for i in range(10): fermat = 2 *...	Give a code snippet in #Python In mathematics, a Fermat number, named after Pierre de Fermat who first studied them, is a positive integer of the form Fn = 22n + 1 where n is a non-negative integer. Despite the simplicity of generating Fermat numbers, they have some powerful mathematical properties and are extensivel...	christopher/rosetta-code
http://rosettacode.org/wiki/Cumulative_standard_deviation	Cumulative standard deviation	Task[edit] Write a stateful function, class, generator or co-routine that takes a series of floating point numbers, one at a time, and returns the running standard deviation of the series. The task implementation should use the most natural programming style of those listed for the function in the implementation langu...	#360_Assembly	360 Assembly	******** Standard deviation of a population STDDEV CSECT USING STDDEV,R13 SAVEAREA B STM-SAVEAREA(R15) DC 17F'0' DC CL8'STDDEV' STM STM R14,R12,12(R13) ST R13,4(R15) ST R15,8(R13) LR R13,R15 SR R8,R8 s=0 ...	Give a code snippet in #360_Assembly Task[edit] Write a stateful function, class, generator or co-routine that takes a series of floating point numbers, one at a time, and returns the running standard deviation of the series. The task implementation should use the most natural programming style of those listed for th...	christopher/rosetta-code
http://rosettacode.org/wiki/Pinstripe/Display	Pinstripe/Display	Sample image The task is to demonstrate the creation of a series of vertical pinstripes across the entire width of the display. in the first quarter the pinstripes should alternate one pixel white, one pixel black = 1 pixel wide vertical pinestripes Quarter of the way down the display, we can switch to a wider 2 pi...	#Java	Java	import java.awt.; import javax.swing.; public class PinstripeDisplay extends JPanel { final int bands = 4; public PinstripeDisplay() { setPreferredSize(new Dimension(900, 600)); } @Override public void paintComponent(Graphics g) { super.paintComponent(g); int h = ge...	Give a code snippet in #Java Sample image The task is to demonstrate the creation of a series of vertical pinstripes across the entire width of the display. in the first quarter the pinstripes should alternate one pixel white, one pixel black = 1 pixel wide vertical pinestripes Quarter of the way down the display,...	christopher/rosetta-code
http://rosettacode.org/wiki/Merge_and_aggregate_datasets	Merge and aggregate datasets	Merge and aggregate datasets Task Merge and aggregate two datasets as provided in .csv files into a new resulting dataset. Use the appropriate methods and data structures depending on the programming language. Use the most common libraries only when built-in functionality is not sufficient. Note Either lo...	#Phix	Phix	constant patients_txt = split(""" PATIENT_ID,LASTNAME 1001,Hopper 4004,Wirth 3003,Kemeny 2002,Gosling 5005,Kurtz""",'\n'), visits_txt = split(""" PATIENT_ID,VISIT_DATE,SCORE 2002,2020-09-10,6.8 1001,2020-09-17,5.5 4004,2020-09-24,8.4 2002,2020-10-08, 1001,,6.6 3003,2020-11-12, 4004,2020-11-05,7.0 1001,2020-11-...	Give a code snippet in #Phix Merge and aggregate datasets Task Merge and aggregate two datasets as provided in .csv files into a new resulting dataset. Use the appropriate methods and data structures depending on the programming language. Use the most common libraries only when built-in functionality is not ...	christopher/rosetta-code
http://rosettacode.org/wiki/HTTP	HTTP	Task Access and print a URL's content (the located resource) to the console. There is a separate task for HTTPS Requests.	#UNIX_Shell	UNIX Shell	curl -s -L http://rosettacode.org/	Give a code snippet in #UNIX_Shell Task Access and print a URL's content (the located resource) to the console. There is a separate task for HTTPS Requests.	christopher/rosetta-code
http://rosettacode.org/wiki/Rhonda_numbers	Rhonda numbers	A positive integer n is said to be a Rhonda number to base b if the product of the base b digits of n is equal to b times the sum of n's prime factors. These numbers were named by Kevin Brown after an acquaintance of his whose residence number was 25662, a member of the base 10 numbers with this property. 25662 is ...	#Perl	Perl	use strict; use warnings; use feature 'say'; use ntheory qw<is_prime factor vecsum vecprod todigitstring todigits>; sub rhonda { my($b, $cnt) = @_; my(@r,$n); while (++$n) { push @r, $n if ($b * vecsum factor($n)) == vecprod todigits($n,$b); return @r if $cnt == @r; } } for my $b (gr...	Give a code snippet in #Perl A positive integer n is said to be a Rhonda number to base b if the product of the base b digits of n is equal to b times the sum of n's prime factors. These numbers were named by Kevin Brown after an acquaintance of his whose residence number was 25662, a member of the base 10 numbers w...	christopher/rosetta-code
http://rosettacode.org/wiki/Sieve_of_Eratosthenes	Sieve of Eratosthenes	This task has been clarified. Its programming examples are in need of review to ensure that they still fit the requirements of the task. The Sieve of Eratosthenes is a simple algorithm that finds the prime numbers up to a given integer. Task Implement the Sieve of Eratosthenes algorithm, with the only allowed...	#Batch_File	Batch File	:: Sieve of Eratosthenes for Rosetta Code - PG @echo off setlocal ENABLEDELAYEDEXPANSION setlocal ENABLEEXTENSIONS rem echo on set /p n=limit: rem set n=100 for /L %%i in (1,1,%n%) do set crible.%%i=1 for /L %%i in (2,1,%n%) do ( if !crible.%%i! EQU 1 ( set /A w = %%i * 2 for /L %%j in (!w!,%%i,%n%) do ( ...	Give a code snippet in #Batch_File This task has been clarified. Its programming examples are in need of review to ensure that they still fit the requirements of the task. The Sieve of Eratosthenes is a simple algorithm that finds the prime numbers up to a given integer. Task Implement the Sieve of Eratosthene...	christopher/rosetta-code
http://rosettacode.org/wiki/Unbias_a_random_generator	Unbias a random generator	P 1 {\displaystyle P_{1}} P 0 {\displaystyle P_{0}} P 1 {\displaystyle P_{1}} P 0 {\displaystyle P_{0}} P 0 {\displaystyle P_{0}} P 1 {\displaystyle P_{1}} Task details Use your language's random number generator to create a function/method/sub...	#F.23	F#	open System let random = Random() let randN = random.Next >> (=)0 >> Convert.ToInt32 let rec unbiased n = let a = randN n if a <> randN n then a else unbiased n [<EntryPoint>] let main argv = let n = if argv.Length > 0 then UInt32.Parse(argv.[0]) \|> int else 100000 for b = 3 to 6 do let ...	Give a code snippet in #F.23 P 1 {\displaystyle P_{1}} P 0 {\displaystyle P_{0}} P 1 {\displaystyle P_{1}} P 0 {\displaystyle P_{0}} P 0 {\displaystyle P_{0}} P 1 {\displaystyle P_{1}} Task details Use your language's random number generator t...	christopher/rosetta-code
http://rosettacode.org/wiki/Determine_sentence_type	Determine sentence type	Use these sentences: "hi there, how are you today? I'd like to present to you the washing machine 9001. You have been nominated to win one of these! Just make sure you don't break it." Task Search for the last used punctuation in a sentence, and determine its type according to its punctuation. Output one of these le...	#FreeBASIC	FreeBASIC	function sentype( byref s as string ) as string 'determines the sentence type of the first sentence in the string 'returns "E" for an exclamation, "Q" for a question, "S" for serious 'and "N" for neutral. 'modifies the string to remove the first sentence for i as uinteger = 1 to len(s) if mi...	Give a code snippet in #FreeBASIC Use these sentences: "hi there, how are you today? I'd like to present to you the washing machine 9001. You have been nominated to win one of these! Just make sure you don't break it." Task Search for the last used punctuation in a sentence, and determine its type according to its p...	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 ...	#Perl	Perl	use strict; use warnings; use List::Util 'min'; # If you want the large output, uncomment either the one line # marked (1) or the two lines marked (2) #use Math::GMP qw/:constant/; # (1) uncomment this to use Math::GMP #use Math::GMPz; # (2) uncomment this plus later line for Math::GMPz s...	Give a code snippet in #Perl 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 numbe...	christopher/rosetta-code
http://rosettacode.org/wiki/Sudoku	Sudoku	Task Solve a partially filled-in normal 9x9 Sudoku grid and display the result in a human-readable format. references Algorithmics of Sudoku may help implement this. Python Sudoku Solver Computerphile video.	#Tcl	Tcl	package require Tcl 8.6 oo::class create Sudoku { variable idata method clear {} { for {set y 0} {$y < 9} {incr y} { for {set x 0} {$x < 9} {incr x} { my set $x $y {} } } } method load {data} { set error "data must be a 9-element list, each element also being a\ list of 9 numbers from...	Give a code snippet in #Tcl Task Solve a partially filled-in normal 9x9 Sudoku grid and display the result in a human-readable format. references Algorithmics of Sudoku may help implement this. Python Sudoku Solver Computerphile video.	christopher/rosetta-code
http://rosettacode.org/wiki/Arithmetic-geometric_mean	Arithmetic-geometric mean	This page uses content from Wikipedia. The original article was at Arithmetic-geometric mean. 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 Write a function to compute the arithmetic-geomet...	#Factor	Factor	USING: kernel math math.functions prettyprint ; IN: rosetta-code.arithmetic-geometric-mean : agm ( a g -- a' g' ) 2dup [ + 0.5 * ] 2dip * sqrt ; 1 1 2 sqrt / [ 2dup - 1e-15 > ] [ agm ] while drop .	Give a code snippet in #Factor This page uses content from Wikipedia. The original article was at Arithmetic-geometric mean. 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 Write a function ...	christopher/rosetta-code
http://rosettacode.org/wiki/Search_a_list	Search a list	Task[edit] Find the index of a string (needle) in an indexable, ordered collection of strings (haystack). Raise an exception if the needle is missing. If there is more than one occurrence then return the smallest index to the needle. Extra credit Return the largest index to a needle that has multiple occurrences in ...	#Erlang	Erlang	-module(index). -export([main/0]). main() -> Haystack = ["Zig","Zag","Wally","Ronald","Bush","Krusty","Charlie","Bush","Bozo"], Needles = ["Washington","Bush"], lists:foreach(fun ?MODULE:print/1, [{N,pos(N, Haystack)} \|\| N <- Needles]). pos(Needle, Haystack) -> pos(Needle, Haystack, 1). pos(_, [], _) ->...	Give a code snippet in #Erlang Task[edit] Find the index of a string (needle) in an indexable, ordered collection of strings (haystack). Raise an exception if the needle is missing. If there is more than one occurrence then return the smallest index to the needle. Extra credit Return the largest index to a needle t...	christopher/rosetta-code
http://rosettacode.org/wiki/Convert_seconds_to_compound_duration	Convert seconds to compound duration	Task Write a function or program which: takes a positive integer representing a duration in seconds as input (e.g., 100), and returns a string which shows the same duration decomposed into: weeks, days, hours, minutes, and seconds. This is detailed below (e.g., "2 hr, 59 sec"). Demonstrat...	#AWK	AWK	# syntax: GAWK -f CONVERT_SECONDS_TO_COMPOUND_DURATION.AWK BEGIN { n = split("7259 86400 6000000 0 1 60 3600 604799 604800 694861",arr," ") for (i=1; i<=n; i++) { printf("%9s %s\n",arr[i],howlong(arr[i])) } exit(0) } function howlong(seconds, n_day,n_hour,n_min,n_sec,n_week,str,x) { if (sec...	Give a code snippet in #AWK Task Write a function or program which: takes a positive integer representing a duration in seconds as input (e.g., 100), and returns a string which shows the same duration decomposed into: weeks, days, hours, minutes, and seconds. This is detailed below (e.g., "...	christopher/rosetta-code
http://rosettacode.org/wiki/Perfect_numbers	Perfect numbers	Write a function which says whether a number is perfect. A perfect number is a positive integer that is the sum of its proper positive divisors excluding the number itself. Equivalently, a perfect number is a number that is half the sum of all of its positive divisors (including itself). Note: The faster Luca...	#M2000_Interpreter	M2000 Interpreter	Module PerfectNumbers { Function Is_Perfect(n as decimal) { s=1 : sN=Sqrt(n) last= n=sN*sN t=n If n mod 2=0 then s+=2+n div 2 i=3 : sN-- While i<sN { if n mod i=0 then t=n div i :i=max.data(n div t, i): s+=t+ i i++ ...	Give a code snippet in #M2000_Interpreter Write a function which says whether a number is perfect. A perfect number is a positive integer that is the sum of its proper positive divisors excluding the number itself. Equivalently, a perfect number is a number that is half the sum of all of its positive divisors (incl...	christopher/rosetta-code
http://rosettacode.org/wiki/Factors_of_an_integer	Factors of an integer	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 \|...	#ProDOS	ProDOS	editvar /newvar /value=a /userinput=1 /title=Enter an integer: do /delimspaces %% -a- >b printline Factors of -a-: -b-	Give a code snippet in #ProDOS 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...	christopher/rosetta-code
http://rosettacode.org/wiki/Text_processing/2	Text processing/2	The following task concerns data that came from a pollution monitoring station with twenty-four instruments monitoring twenty-four aspects of pollution in the air. Periodically a record is added to the file, each record being a line of 49 fields separated by white-space, which can be one or more space or tab characters...	#Kotlin	Kotlin	// version 1.2.31 import java.io.File fun main(args: Array<String>) { val rx = Regex("""\s+""") val file = File("readings.txt") var count = 0 var invalid = 0 var allGood = 0 var map = mutableMapOf<String, Int>() file.forEachLine { line -> count++ val fields = line.split(r...	Give a code snippet in #Kotlin The following task concerns data that came from a pollution monitoring station with twenty-four instruments monitoring twenty-four aspects of pollution in the air. Periodically a record is added to the file, each record being a line of 49 fields separated by white-space, which can be one...	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	#SPL	SPL	#.output("Hello world!")	Give a code snippet in #SPL 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/Anti-primes	Anti-primes	The anti-primes (or highly composite numbers, sequence A002182 in the OEIS) are the natural numbers with more factors than any smaller than itself. Task Generate and show here, the first twenty anti-primes. Related tasks Factors of an integer Sieve of Eratosthenes	#Ruby	Ruby	require 'prime' def num_divisors(n) n.prime_division.inject(1){\|prod, (_p,n)\| prod *= (n + 1) } end anti_primes = Enumerator.new do \|y\| # y is the yielder max = 0 y << 1 # yield 1 2.step(nil,2) do \|candidate\| # nil is taken as Infinity num = num_divisors(candidate) ...	Give a code snippet in #Ruby The anti-primes (or highly composite numbers, sequence A002182 in the OEIS) are the natural numbers with more factors than any smaller than itself. Task Generate and show here, the first twenty anti-primes. Related tasks Factors of an integer Sieve of Eratosthenes	christopher/rosetta-code
http://rosettacode.org/wiki/Even_or_odd	Even or odd	Task Test whether an integer is even or odd. There is more than one way to solve this task: Use the even and odd predicates, if the language provides them. Check the least significant digit. With binary integers, i bitwise-and 1 equals 0 iff i is even, or equals 1 iff i is odd. Divide i by 2. The remainder equals...	#Ruby	Ruby	print "evens: " p -5.upto(5).select(&:even?) print "odds: " p -5.upto(5).select(&:odd?)	Give a code snippet in #Ruby Task Test whether an integer is even or odd. There is more than one way to solve this task: Use the even and odd predicates, if the language provides them. Check the least significant digit. With binary integers, i bitwise-and 1 equals 0 iff i is even, or equals 1 iff i is odd. Divid...	christopher/rosetta-code
http://rosettacode.org/wiki/Sum_multiples_of_3_and_5	Sum multiples of 3 and 5	Task The objective is to write a function that finds the sum of all positive multiples of 3 or 5 below n. Show output for n = 1000. This is is the same as Project Euler problem 1. Extra credit: do this efficiently for n = 1e20 or higher.	#jq	jq	def sum_multiples(d): ((./d) \| floor) \| (d * . * (.+1))/2 ; # Sum of multiples of a or b that are less than . (the input) def task(a;b): . - 1 \| sum_multiples(a) + sum_multiples(b) - sum_multiples(a*b);	Give a code snippet in #jq Task The objective is to write a function that finds the sum of all positive multiples of 3 or 5 below n. Show output for n = 1000. This is is the same as Project Euler problem 1. Extra credit: do this efficiently for n = 1e20 or higher.	christopher/rosetta-code
http://rosettacode.org/wiki/Fractal_tree	Fractal tree	Generate and draw a fractal tree. Draw the trunk At the end of the trunk, split by some angle and draw two branches Repeat at the end of each branch until a sufficient level of branching is reached Related tasks Pythagoras Tree	#Scala	Scala	import swing._ import java.awt.{RenderingHints, BasicStroke, Color} object FractalTree extends SimpleSwingApplication { val DEPTH = 9 def top = new MainFrame { contents = new Panel { preferredSize = new Dimension(600, 500) override def paintComponent(g: Graphics2D) { draw(300, 460, -90...	Give a code snippet in #Scala Generate and draw a fractal tree. Draw the trunk At the end of the trunk, split by some angle and draw two branches Repeat at the end of each branch until a sufficient level of branching is reached Related tasks Pythagoras Tree	christopher/rosetta-code
http://rosettacode.org/wiki/Floyd-Warshall_algorithm	Floyd-Warshall algorithm	The Floyd–Warshall algorithm is an algorithm for finding shortest paths in a weighted graph with positive or negative edge weights. Task Find the lengths of the shortest paths between all pairs of vertices of the given directed graph. Your code may assume that the input has already been checked for loops, parallel ...	#Scheme	Scheme	;;; Floyd-Warshall algorithm. ;;; ;;; See https://en.wikipedia.org/w/index.php?title=Floyd%E2%80%93Warshall_algorithm&oldid=1082310013 ;;; (import (scheme base)) (import (scheme cxr)) (import (scheme write)) ;;; ;;; A square array will be represented by a cons-pair: ;;; ;;; (vector-of-length n-squared . n) ;;; ;...	Give a code snippet in #Scheme The Floyd–Warshall algorithm is an algorithm for finding shortest paths in a weighted graph with positive or negative edge weights. Task Find the lengths of the shortest paths between all pairs of vertices of the given directed graph. Your code may assume that the input has already b...	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 ...	#JavaScript	JavaScript	var fso = new ActiveXObject("Scripting.FileSystemObject"); var ForReading = 1, ForWriting = 2; var f_in = fso.OpenTextFile('input.txt', ForReading); var f_out = fso.OpenTextFile('output.txt', ForWriting, true); // for small files: // f_out.Write( f_in.ReadAll() ); while ( ! f_in.AtEndOfStream) { // ReadLine() ...	Give a code snippet in #JavaScript 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 f...	christopher/rosetta-code
http://rosettacode.org/wiki/Symmetric_difference	Symmetric difference	Task Given two sets A and B, compute ( A ∖ B ) ∪ ( B ∖ A ) . {\displaystyle (A\setminus B)\cup (B\setminus A).} That is, enumerate the items that are in A or B but not both. This set is called the symmetric difference of A and B. In other words: ( A ∪ B ) ∖ ( A ∩ B ) {\displaystyle (A\cup B)\setminus (A...	#REBOL	REBOL	a: [John Serena Bob Mary Serena] b: [Jim Mary John Jim Bob] difference a b	Give a code snippet in #REBOL Task Given two sets A and B, compute ( A ∖ B ) ∪ ( B ∖ A ) . {\displaystyle (A\setminus B)\cup (B\setminus A).} That is, enumerate the items that are in A or B but not both. This set is called the symmetric difference of A and B. In other words: ( A ∪ B ) ∖ ( A ∩ B ) {\dis...	christopher/rosetta-code
http://rosettacode.org/wiki/Runtime_evaluation	Runtime evaluation	Task Demonstrate a language's ability for programs to execute code written in the language provided at runtime. Show what kind of program fragments are permitted (e.g. expressions vs. statements), and how to get values in and out (e.g. environments, arguments, return values), if applicable what lexical/static environ...	#Groovy	Groovy	[2011, 2016, 2022, 2033, 2039, 2044, 2050, 2061, 2067, 2072, 2078, 2089, 2095, 2101, 2107, 2112, 2118]	Give a code snippet in #Groovy Task Demonstrate a language's ability for programs to execute code written in the language provided at runtime. Show what kind of program fragments are permitted (e.g. expressions vs. statements), and how to get values in and out (e.g. environments, arguments, return values), if applic...	christopher/rosetta-code
http://rosettacode.org/wiki/Abundant,_deficient_and_perfect_number_classifications	Abundant, deficient and perfect number classifications	These define three classifications of positive integers based on their proper divisors. Let P(n) be the sum of the proper divisors of n where the proper divisors are all positive divisors of n other than n itself. if P(n) < n then n is classed as deficient (OEIS A005100). if P(n)...	#Oforth	Oforth	import: mapping Integer method: properDivs -- [] self 2 / seq filter( #[ self swap mod 0 == ] ) ; : numberClasses \| i deficient perfect s \| 0 0 ->deficient ->perfect 0 20000 loop: i [ 0 #+ i properDivs apply ->s s i < ifTrue: [ deficient 1+ ->deficient continue ] s i == ifTrue: [ perf...	Give a code snippet in #Oforth These define three classifications of positive integers based on their proper divisors. Let P(n) be the sum of the proper divisors of n where the proper divisors are all positive divisors of n other than n itself. if P(n) < n then n is classed as deficien...	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.	#Rust	Rust	fn main() { let nums = [1,2,39,34,20]; println!("{:?}", nums.iter().max()); println!("{}", nums.iter().max().unwrap()); }	Give a code snippet in #Rust 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/100_doors	100 doors	There are 100 doors in a row that are all initially closed. You make 100 passes by the doors. The first time through, visit every door and toggle the door (if the door is closed, open it; if it is open, close it). The second time, only visit every 2nd door (door #2, #4, #6, ...), and toggle it. The third...	#Dc	Dc	## NB: This code uses the dc command "r" via register "r". ## You may comment out the unwanted version. [SxSyLxLy]sr # this should work with every "dc" [r]sr # GNU dc can exchange top 2 stack values by "r" ## Now use "lrx" instead of "r" ... 0k # we work without decimal places [q]sq ...	Give a code snippet in #Dc There are 100 doors in a row that are all initially closed. You make 100 passes by the doors. The first time through, visit every door and toggle the door (if the door is closed, open it; if it is open, close it). The second time, only visit every 2nd door (door #2, #4, #6, ...),...	christopher/rosetta-code
http://rosettacode.org/wiki/Secure_temporary_file	Secure temporary file	Task Create a temporary file, securely and exclusively (opening it such that there are no possible race conditions). It's fine assuming local filesystem semantics (NFS or other networking filesystems can have signficantly more complicated semantics for satisfying the "no race conditions" criteria). The function shou...	#TUSCRIPT	TUSCRIPT	$$ MODE TUSCRIPT tmpfile="test.txt" ERROR/STOP CREATE (tmpfile,seq-E,-std-) text="hello world" FILE $tmpfile = text - tmpfile "test.txt" can only be accessed by one user an will be deleted upon programm termination	Give a code snippet in #TUSCRIPT Task Create a temporary file, securely and exclusively (opening it such that there are no possible race conditions). It's fine assuming local filesystem semantics (NFS or other networking filesystems can have signficantly more complicated semantics for satisfying the "no race conditi...	christopher/rosetta-code
http://rosettacode.org/wiki/Real_constants_and_functions	Real constants and functions	Task Show how to use the following math constants and functions in your language (if not available, note it): e (base of the natural logarithm) π {\displaystyle \pi } square root logarithm (any base allowed) exponential (ex ) absolute value (a.k.a. "magnitude") floor (largest ...	#ERRE	ERRE	PROGRAM R_C_F FUNCTION CEILING(X) CEILING=INT(X)-(X-INT(X)>0) END FUNCTION FUNCTION FLOOR(X) FLOOR=INT(X) END FUNCTION BEGIN PRINT(EXP(1)) ! e not available PRINT(π) ! pi is available or .... PRINT(4*ATN(1)) ! .... equal to X=12.345 Y=1.23 ...	Give a code snippet in #ERRE Task Show how to use the following math constants and functions in your language (if not available, note it): e (base of the natural logarithm) π {\displaystyle \pi } square root logarithm (any base allowed) exponential (ex ) absolute value (a.k.a. "ma...	christopher/rosetta-code
http://rosettacode.org/wiki/Date_manipulation	Date manipulation	Task Given the date string "March 7 2009 7:30pm EST", output the time 12 hours later in any human-readable format. As extra credit, display the resulting time in a time zone different from your own.	#zkl	zkl	var Date=Time.Date; fcn add12h(dt){ re:=RegExp(0'\|(\w+)\s+(\d+)\s+(\d+)\ +(.+)\s\|); re.search(dt); _,M,D,Y,hms:=re.matched; //"March","7","2009","7:30pm" M=Date.monthNames.index(M); //3 h,m,s:=Date.parseTime(hms); //19,30,0 dti:=T(Y,M,D, h,m,s).apply("toInt"); Y,M,D, h,m,s=Date.addHMS(dti,12); ...	Give a code snippet in #zkl Task Given the date string "March 7 2009 7:30pm EST", output the time 12 hours later in any human-readable format. As extra credit, display the resulting time in a time zone different from your own.	christopher/rosetta-code
http://rosettacode.org/wiki/Execute_Brain****	Execute Brain****	Execute Brain** is an implementation of Brainf. Other implementations of Brainf. RCBF is a set of Brainf* compilers and interpreters written for Rosetta Code in a variety of languages. Below are links to each of the versions of RCBF. An implementation need only properly implement the following instructions:...	#Ol	Ol	(define (bf program stack-length) (let ((program (string-append program "]")); end (program-counter 0) (stack (make-bytevector stack-length 0)) (stack-pointer 0)) (letrec ((skip (lambda (PC sp in) (let loop ((pc PC) (sp sp) (in in)) ...	Give a code snippet in #Ol Execute Brain** is an implementation of Brainf. Other implementations of Brainf. RCBF is a set of Brainf* compilers and interpreters written for Rosetta Code in a variety of languages. Below are links to each of the versions of RCBF. An implementation need only properly implement...	christopher/rosetta-code
http://rosettacode.org/wiki/Averages/Mode	Averages/Mode	Task[edit] Write a program to find the mode value of a collection. The case where the collection is empty may be ignored. Care must be taken to handle the case where the mode is non-unique. If it is not appropriate or possible to support a general collection, use a vector (array), if possible. If it is not appropriat...	#Python	Python	>>> from collections import defaultdict >>> def modes(values): count = defaultdict(int) for v in values: count[v] +=1 best = max(count.values()) return [k for k,v in count.items() if v == best] >>> modes([1,3,6,6,6,6,7,7,12,12,17]) [6] >>> modes((1,1,2,4,4)) [1, 4]	Give a code snippet in #Python Task[edit] Write a program to find the mode value of a collection. The case where the collection is empty may be ignored. Care must be taken to handle the case where the mode is non-unique. If it is not appropriate or possible to support a general collection, use a vector (array), if p...	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...	#Extended_BrainF.2A.2A.2A	Extended BrainF***	#light let rec bottles n = let (before, after) = match n with \| 1 -> ("bottle", "bottles") \| 2 -> ("bottles", "bottle") \| n -> ("bottles", "bottles") printfn "%d %s of beer on the wall" n before printfn "%d %s of beer" n before ...	Give a code snippet in #Extended_BrainF.2A.2A.2A 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 be...	christopher/rosetta-code
http://rosettacode.org/wiki/Monty_Hall_problem	Monty Hall problem	Suppose you're on a game show and you're given the choice of three doors. Behind one door is a car; behind the others, goats. The car and the goats were placed randomly behind the doors before the show. Rules of the game After you have chosen a door, the door remains closed for the time being. The game show hos...	#Pascal	Pascal	program MontyHall; uses sysutils; const NumGames = 1000; {Randomly pick a door(a number between 0 and 2} function PickDoor(): Integer; begin Exit(Trunc(Random * 3)); end; var i: Integer; PrizeDoor: Integer; ChosenDoor: Integer; WinsChangingDoors: Integer = 0; WinsNotChangingDoors: Integer = 0;...	Give a code snippet in #Pascal Suppose you're on a game show and you're given the choice of three doors. Behind one door is a car; behind the others, goats. The car and the goats were placed randomly behind the doors before the show. Rules of the game After you have chosen a door, the door remains closed for th...	christopher/rosetta-code
http://rosettacode.org/wiki/Window_creation	Window creation	Display a GUI window. The window need not have any contents, but should respond to requests to be closed.	#Clojure	Clojure	(import '(javax.swing JFrame)) (let [frame (JFrame. "A Window")] (doto frame (.setSize 600 800) (.setVisible true)))	Give a code snippet in #Clojure Display a GUI window. The window need not have any contents, but should respond to requests to be closed.	christopher/rosetta-code
http://rosettacode.org/wiki/Singly-linked_list/Element_definition	Singly-linked list/Element definition	singly-linked list See also Array Associative array: Creation, Iteration Collections Compound data type Doubly-linked list: Definition, Element definition, Element insertion, List Traversal, Element Removal Linked list Queue: Definition, Usage Set Singly-linked list: Element definition, Element insertion, Lis...	#PicoLisp	PicoLisp	declare 1 node based (p), 2 value fixed, 2 link pointer;	Give a code snippet in #PicoLisp singly-linked list See also Array Associative array: Creation, Iteration Collections Compound data type Doubly-linked list: Definition, Element definition, Element insertion, List Traversal, Element Removal Linked list Queue: Definition, Usage Set Singly-linked list: Element ...	christopher/rosetta-code
http://rosettacode.org/wiki/Additive_primes	Additive primes	Definitions In mathematics, additive primes are prime numbers for which the sum of their decimal digits are also primes. Task Write a program to determine (and show here) all additive primes less than 500. Optionally, show the number of additive primes. Also see the OEIS entry: A046704 additive primes. ...	#Delphi	Delphi	proc sieve([] bool prime) void: word max, p, c; max := dim(prime,1)-1; prime[0] := false; prime[1] := false; for p from 2 upto max do prime[p] := true od; for p from 2 upto max/2 do for c from p2 by p upto max do prime[c] := false od od corp proc digit_sum(wor...	Give a code snippet in #Delphi Definitions In mathematics, additive primes are prime numbers for which the sum of their decimal digits are also primes. Task Write a program to determine (and show here) all additive primes less than 500. Optionally, show the number of additive primes. Also see the OEIS entry...	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...	#AutoHotkey	AutoHotkey	While mod(A_Index, 6) ;comment:everything but 0 is considered true output = %output%`n%A_Index% MsgBox % output	Give a code snippet in #AutoHotkey 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 Lo...	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...	#M2000_Interpreter	M2000 Interpreter	Module Ycombinator { \\ y() return value. no use of closure y=lambda (g, x)->g(g, x) Print y(lambda (g, n as decimal)->if(n=0->1, n*g(g, n-1)), 10)=3628800 ' true Print y(lambda (g, n)->if(n<=1->n,g(g, n-1)+g(g, n-2)), 10)=55 ' true \\ Using closure in y, y() return function y=lambda (g)->lambda g (x) -> g(g,...	Give a code snippet in #M2000_Interpreter 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 s...	christopher/rosetta-code
http://rosettacode.org/wiki/Peaceful_chess_queen_armies	Peaceful chess queen armies	In chess, a queen attacks positions from where it is, in straight lines up-down and left-right as well as on both its diagonals. It attacks only pieces not of its own colour. ⇖ ⇑ ⇗ ⇐ ⇐ ♛ ⇒ ⇒ ⇙ ⇓ ⇘ ⇙ ⇓ ⇘ ⇓ The goal of Peaceful chess queen armies is to arrange m black queens and m white queens ...	#Phix	Phix	-- -- demo\rosetta\Queen_Armies.exw -- ============================= -- with javascript_semantics requires("1.0.2") -- (puts(fn,x,false) for p2js.js) string html = "" constant as_html = true constant queens = {``, `♛`, `<font color="green">♕</font>`, `<span styl...	Give a code snippet in #Phix In chess, a queen attacks positions from where it is, in straight lines up-down and left-right as well as on both its diagonals. It attacks only pieces not of its own colour. ⇖ ⇑ ⇗ ⇐ ⇐ ♛ ⇒ ⇒ ⇙ ⇓ ⇘ ⇙ ⇓ ⇘ ⇓ The goal of Peaceful chess queen armies is to arrange m bl...	christopher/rosetta-code
http://rosettacode.org/wiki/Sum_and_product_of_an_array	Sum and product of an array	Task Compute the sum and product of an array of integers.	#Run_BASIC	Run BASIC	dim array(100) for i = 1 To 100 array(i) = rnd(0) * 100 next i product = 1 for i = 0 To 19 sum = (sum + array(i)) product = (product * array(i)) next i Print " Sum is ";sum Print "Product is ";product	Give a code snippet in #Run_BASIC Task Compute the sum and product of an array of integers.	christopher/rosetta-code
http://rosettacode.org/wiki/World_Cup_group_stage	World Cup group stage	It's World Cup season (or at least it was when this page was created)! The World Cup is an international football/soccer tournament that happens every 4 years. Countries put their international teams together in the years between tournaments and qualify for the tournament based on their performance in other internat...	#Elixir	Elixir	defmodule World_Cup do def group_stage do results = [[3,0],[1,1],[0,3]] teams = [0,1,2,3] allresults = combos(2,teams) \|> combinations(results) allpoints = for list <- allresults, do: (for {l1,l2} <- list, do: Enum.zip(l1,l2)) \|> List.flatten totalpoints = for list <- allpoints, do: (for t <- team...	Give a code snippet in #Elixir It's World Cup season (or at least it was when this page was created)! The World Cup is an international football/soccer tournament that happens every 4 years. Countries put their international teams together in the years between tournaments and qualify for the tournament based on the...	christopher/rosetta-code
http://rosettacode.org/wiki/Abbreviations,_easy	Abbreviations, easy	This task is an easier (to code) variant of the Rosetta Code task: Abbreviations, simple. For this task, the following command table will be used: Add ALTer BAckup Bottom CAppend Change SCHANGE CInsert CLAst COMPress COpy COUnt COVerlay CURsor DELete CDelete Down DUPlicate Xedit EXPand EXTract Find ...	#Prolog	Prolog	:- initialization(main). command_table("Add ALTer BAckup Bottom CAppend Change SCHANGE CInsert CLAst COMPress COpy COUnt COVerlay CURsor DELete CDelete Down DUPlicate Xedit EXPand EXTract Find NFind NFINDUp NFUp CFind FINdup FUp FOrward GET Help HEXType Input POWerinput Join SPlit SPLTJOIN LOAD Locate CLocate ...	Give a code snippet in #Prolog This task is an easier (to code) variant of the Rosetta Code task: Abbreviations, simple. For this task, the following command table will be used: Add ALTer BAckup Bottom CAppend Change SCHANGE CInsert CLAst COMPress COpy COUnt COVerlay CURsor DELete CDelete Down DUPl...	christopher/rosetta-code
http://rosettacode.org/wiki/Jump_anywhere	Jump anywhere	Imperative programs conditional structures loops local jumps This task is to demonstrate a local jump and a global jump and the various other types of jumps that the language supports. For the purpose of this task, the jumps need not be used for a single purpose and you have the freedom to use these jumps for different...	#Fortran	Fortran	' FB 1.05.0 Win64 ' compiled with -lang fb (the default) and -e switches Sub MySub() Goto localLabel Dim a As Integer = 10 '' compiler warning that this variable definition is being skipped localLabel: Print "localLabel reached" Print "a = "; a '' prints garbage as 'a' is uninitialized End Sub Sub MyS...	Give a code snippet in #Fortran Imperative programs conditional structures loops local jumps This task is to demonstrate a local jump and a global jump and the various other types of jumps that the language supports. For the purpose of this task, the jumps need not be used for a single purpose and you have the freedom...	christopher/rosetta-code
http://rosettacode.org/wiki/Environment_variables	Environment variables	Task Show how to get one of your process's environment variables. The available variables vary by system; some of the common ones available on Unix include: PATH HOME USER	#BASIC	BASIC	x$ = ENVIRON$("path") PRINT x$	Give a code snippet in #BASIC Task Show how to get one of your process's environment variables. The available variables vary by system; some of the common ones available on Unix include: PATH HOME USER	christopher/rosetta-code
http://rosettacode.org/wiki/Largest_int_from_concatenated_ints	Largest int from concatenated ints	Task Given a set of positive integers, write a function to order the integers in such a way that the concatenation of the numbers forms the largest possible integer and return this integer. Use the following two sets of integers as tests and show your program output here. {1, 34, 3, 98, 9, 76, 45, 4} {54,...	#C.23	C#	using System; using System.Collections.Generic; using System.Linq; class Program { static void Main(string[] args) { var source1 = new int[] { 1, 34, 3, 98, 9, 76, 45, 4 }; var source2 = new int[] { 54, 546, 548, 60 }; var largest1 = LargestPossibleSequence(source1); var larg...	Give a code snippet in #C.23 Task Given a set of positive integers, write a function to order the integers in such a way that the concatenation of the numbers forms the largest possible integer and return this integer. Use the following two sets of integers as tests and show your program output here. {1, 34...	christopher/rosetta-code
http://rosettacode.org/wiki/AVL_tree	AVL tree	This page uses content from Wikipedia. The original article was at AVL tree. 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) In computer science, an AVL tree is a self-balancing binary search tree....	#Ada	Ada	with Ada.Text_IO, Ada.Finalization, Ada.Unchecked_Deallocation; procedure Main is generic type Key_Type is private; with function "<"(a, b : Key_Type) return Boolean is <>; with function "="(a, b : Key_Type) return Boolean is <>; with function "<="(a, b : Key_Type) return Boolean is <>;...	Give a code snippet in #Ada This page uses content from Wikipedia. The original article was at AVL tree. 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) In computer science, an AVL tree is a self-...	christopher/rosetta-code
http://rosettacode.org/wiki/Strip_a_set_of_characters_from_a_string	Strip a set of characters from a string	Task Create a function that strips a set of characters from a string. The function should take two arguments: a string to be stripped a string containing the set of characters to be stripped The returned string should contain the first string, stripped of any characters in the second argument: print str...	#Seed7	Seed7	$ include "seed7_05.s7i"; const func string: stripchars (in string: mainStri, in string: charList) is func result var string: strippedStri is ""; local var char: ch is ' '; begin strippedStri := mainStri; for ch range charList do strippedStri := replace(strippedStri, str(ch), ""); end ...	Give a code snippet in #Seed7 Task Create a function that strips a set of characters from a string. The function should take two arguments: a string to be stripped a string containing the set of characters to be stripped The returned string should contain the first string, stripped of any characters in t...	christopher/rosetta-code
http://rosettacode.org/wiki/Loops/While	Loops/While	Task Start an integer value at 1024. Loop while it is greater than zero. Print the value (with a newline) and divide it by two each time through the loop. Related tasks Loop over multiple arrays simultaneously Loops/Break Loops/Continue Loops/Do-while Loops/Downward for Loops/For Loops/For...	#K	K	{while[x>0; \echo x; x%:2]} 1024	Give a code snippet in #K Task Start an integer value at 1024. Loop while it is greater than zero. Print the value (with a newline) and divide it by two each time through the loop. Related tasks Loop over multiple arrays simultaneously Loops/Break Loops/Continue Loops/Do-while Loops/Downward fo...	christopher/rosetta-code
http://rosettacode.org/wiki/Trigonometric_functions	Trigonometric functions	Task If your language has a library or built-in functions for trigonometry, show examples of: sine cosine tangent inverses (of the above) using the same angle in radians and degrees. For the non-inverse functions, each radian/degree pair should use arguments that evaluate to the same angle (that i...	#NetRexx	NetRexx	/* NetRexx */ options replace format comments java crossref symbols nobinary utf8 numeric digits 30 parse 'Radians Degrees angle' RADIANS DEGREES ANGLE .; parse 'sine cosine tangent arcsine arccosine arctangent' SINE COSINE TANGENT ARCSINE ARCCOSINE ARCTANGENT . trigVals = '' trigVals[RADIANS, ANGLE ] = (Rexx...	Give a code snippet in #NetRexx Task If your language has a library or built-in functions for trigonometry, show examples of: sine cosine tangent inverses (of the above) using the same angle in radians and degrees. For the non-inverse functions, each radian/degree pair should use arguments that eva...	christopher/rosetta-code
http://rosettacode.org/wiki/Shell_one-liner	Shell one-liner	Task Show how to specify and execute a short program in the language from a command shell, where the input to the command shell is only one line in length. Avoid depending on the particular shell or operating system used as much as is reasonable; if the language has notable implementations which have different comman...	#Burlesque	Burlesque	Burlesque.exe --no-stdin "5 5 .+"	Give a code snippet in #Burlesque Task Show how to specify and execute a short program in the language from a command shell, where the input to the command shell is only one line in length. Avoid depending on the particular shell or operating system used as much as is reasonable; if the language has notable implemen...	christopher/rosetta-code
http://rosettacode.org/wiki/Semiprime	Semiprime	Semiprime numbers are natural numbers that are products of exactly two (possibly equal) prime numbers. Semiprimes are also known as: semi-primes biprimes bi-primes 2-almost primes or simply: P2 Example 1679 = 23 × 73 (This particular number was chosen as the length of the Arecib...	#Wren	Wren	var semiprime = Fn.new { \|n\| if (n < 3) return false var nf = 0 for (i in 2..n) { while (n%i == 0) { if (nf == 2) return false nf = nf + 1 n = (n/i).floor } } return nf == 2 } for (v in 1675..1680) { System.print("%(v) -> %(semiprime.call(v) ...	Give a code snippet in #Wren Semiprime numbers are natural numbers that are products of exactly two (possibly equal) prime numbers. Semiprimes are also known as: semi-primes biprimes bi-primes 2-almost primes or simply: P2 Example 1679 = 23 × 73 (This particular number was chos...	christopher/rosetta-code
http://rosettacode.org/wiki/Bitmap/Write_a_PPM_file	Bitmap/Write a PPM file	Using the data storage type defined on this page for raster images, write the image to a PPM file (binary P6 prefered). (Read the definition of PPM file on Wikipedia.)	#E	E	-module(ppm). -export([ppm/1, write/2]). -define(WHITESPACE, <<10>>). -define(SPACE, <<32>>). % data structure introduced in task Bitmap (module ros_bitmap.erl) -record(bitmap, { pixels = nil, shape = {0, 0} }). % create ppm image from bitmap record ppm(Bitmap) -> {Width, Height} = Bitmap#bitmap...	Give a code snippet in #E Using the data storage type defined on this page for raster images, write the image to a PPM file (binary P6 prefered). (Read the definition of PPM file on Wikipedia.)	christopher/rosetta-code
http://rosettacode.org/wiki/HTTP	HTTP	Task Access and print a URL's content (the located resource) to the console. There is a separate task for HTTPS Requests.	#Erlang	Erlang	-module(main). -export([main/1]). main([Url\|[]]) -> inets:start(), case http:request(Url) of {ok, {_V, _H, Body}} -> io:fwrite("~p~n",[Body]); {error, Res} -> io:fwrite("~p~n", [Res]) end.	Give a code snippet in #Erlang Task Access and print a URL's content (the located resource) to the console. There is a separate task for HTTPS Requests.	christopher/rosetta-code
http://rosettacode.org/wiki/Bitmap	Bitmap	Show a basic storage type to handle a simple RGB raster graphics image, and some primitive associated functions. If possible provide a function to allocate an uninitialised image, given its width and height, and provide 3 additional functions: one to fill an image with a plain RGB color, one to set a given pixe...	#Applesoft_BASIC	Applesoft BASIC	100 W = 8 110 H = 8 120 BB = 24576 + LEN ( STR$ (W) + STR$ (H)) + 9: REM P6 HEADER 130 HIMEM: 8192 140 R = 255 150 G = 255 160 B = 0 170 C = R + G * 256 + B * 65536 180 GOSUB 600FILL 190 X = 4 200 Y = 5 210 R = 127 220 G = 127 230 B = 255 240 C = R + G * 256 + B * 65536 250 GOSUB 500"SET PIXEL" 2...	Give a code snippet in #Applesoft_BASIC Show a basic storage type to handle a simple RGB raster graphics image, and some primitive associated functions. If possible provide a function to allocate an uninitialised image, given its width and height, and provide 3 additional functions: one to fill an image with a pl...	christopher/rosetta-code
http://rosettacode.org/wiki/Repeat_a_string	Repeat a string	Take a string and repeat it some number of times. Example: repeat("ha", 5) => "hahahahaha" If there is a simpler/more efficient way to repeat a single “character” (i.e. creating a string filled with a certain character), you might want to show that as well (i.e. repeat-char("", 5) => "****"). Other tasks re...	#BaCon	BaCon	DOTIMES 5 s$ = s$ & "ha" DONE PRINT s$	Give a code snippet in #BaCon Take a string and repeat it some number of times. Example: repeat("ha", 5) => "hahahahaha" If there is a simpler/more efficient way to repeat a single “character” (i.e. creating a string filled with a certain character), you might want to show that as well (i.e. repeat-char("*", 5) ...	christopher/rosetta-code
http://rosettacode.org/wiki/Luhn_test_of_credit_card_numbers	Luhn test of credit card numbers	The Luhn test is used by some credit card companies to distinguish valid credit card numbers from what could be a random selection of digits. Those companies using credit card numbers that can be validated by the Luhn test have numbers that pass the following test: Reverse the order of the digits in the number. Tak...	#sed	sed	# Split number into double evens and odds s/./&: / : split s/\([0-4]\)\([0-9]\):\(.\) /:\1\1\3 \2/ s/\([5-9]\)\([0-9]\):\(.\) /:1\1\1\3 \2/ t split # Set up addition lookup table s/\([0-9]\):\(.\) \(.\)/\1\2\3:0123456789012345678/ : add s/\([0-9]\)0:/\1:/ s/\([0-9]\)1:\(.\1.\{0\}\([0-9]\).\)/\3:\2/ s/\([0-9...	Give a code snippet in #sed The Luhn test is used by some credit card companies to distinguish valid credit card numbers from what could be a random selection of digits. Those companies using credit card numbers that can be validated by the Luhn test have numbers that pass the following test: Reverse the order of t...	christopher/rosetta-code
http://rosettacode.org/wiki/Floyd-Warshall_algorithm	Floyd-Warshall algorithm	The Floyd–Warshall algorithm is an algorithm for finding shortest paths in a weighted graph with positive or negative edge weights. Task Find the lengths of the shortest paths between all pairs of vertices of the given directed graph. Your code may assume that the input has already been checked for loops, parallel ...	#C.2B.2B	C++	#include <iostream> #include <vector> #include <sstream> void print(std::vector<std::vector<double>> dist, std::vector<std::vector<int>> next) { std::cout << "(pair, dist, path)" << std::endl; const auto size = std::size(next); for (auto i = 0; i < size; ++i) { for (auto j = 0; j < size; ++j) { if (i ...	Give a code snippet in #C.2B.2B The Floyd–Warshall algorithm is an algorithm for finding shortest paths in a weighted graph with positive or negative edge weights. Task Find the lengths of the shortest paths between all pairs of vertices of the given directed graph. Your code may assume that the input has already ...	christopher/rosetta-code
http://rosettacode.org/wiki/Show_ASCII_table	Show ASCII table	Task Show the ASCII character set from values 32 to 127 (decimal) in a table format. Other tasks related to string operations: Metrics Array length String length Copy a string Empty string (assignment) Counting Word frequency Letter frequency Jewels and stones I before E except after C Bioin...	#ALGOL_W	ALGOL W	begin % generate an ascii table for chars 32 - 127 % integer cPos; cPos := 0; for i := 32 until 127 do begin if cPos = 0 then write(); cPos := ( cPos + 1 ) rem 6; writeon( i_w := 3, s_w := 0, i, ": " ); if i = 32 then writeon( "Spc ") else if i = ...	Give a code snippet in #ALGOL_W Task Show the ASCII character set from values 32 to 127 (decimal) in a table format. Other tasks related to string operations: Metrics Array length String length Copy a string Empty string (assignment) Counting Word frequency Letter frequency Jewels and stones ...	christopher/rosetta-code
http://rosettacode.org/wiki/Infinity	Infinity	Task Write a function which tests if infinity is supported for floating point numbers (this step should be omitted for languages where the language specification already demands the existence of infinity, e.g. by demanding IEEE numbers), and if so, returns positive infinity. Otherwise, return the largest possible po...	#Oz	Oz	declare PosInf = 1./0. NegInf = ~1./0. in {Show PosInf} {Show NegInf} %% some assertion 42. / PosInf = 0. 42. / NegInf = 0. PosInf * PosInf = PosInf PosInf * NegInf = NegInf NegInf * NegInf = PosInf	Give a code snippet in #Oz Task Write a function which tests if infinity is supported for floating point numbers (this step should be omitted for languages where the language specification already demands the existence of infinity, e.g. by demanding IEEE numbers), and if so, returns positive infinity. Otherwise, re...	christopher/rosetta-code
http://rosettacode.org/wiki/Safe_addition	Safe addition	Implementation of interval arithmetic and more generally fuzzy number arithmetic require operations that yield safe upper and lower bounds of the exact result. For example, for an addition, it is the operations +↑ and +↓ defined as: a +↓ b ≤ a + b ≤ a +↑ b. Additionally it is desired that the widt...	#Mathematica.2FWolfram_Language	Mathematica/Wolfram Language	import fenv, strutils proc `++`(a, b: float): tuple[lower, upper: float] = let a {.volatile.} = a b {.volatile.} = b orig = fegetround() discard fesetround FE_DOWNWARD result.lower = a + b discard fesetround FE_UPWARD result.upper = a + b discard fesetround orig proc ff(a: float): string = a...	Give a code snippet in #Mathematica.2FWolfram_Language Implementation of interval arithmetic and more generally fuzzy number arithmetic require operations that yield safe upper and lower bounds of the exact result. For example, for an addition, it is the operations +↑ and +↓ defined as: a +↓ b ≤ a ...	christopher/rosetta-code
http://rosettacode.org/wiki/User_input/Graphical	User input/Graphical	In this task, the goal is to input a string and the integer 75000, from graphical user interface. See also: User input/Text	#Delphi	Delphi	program UserInputGraphical; {$APPTYPE CONSOLE} uses SysUtils, Dialogs; var s: string; lStringValue: string; lIntegerValue: Integer; begin lStringValue := InputBox('User input/Graphical', 'Enter a string', ''); repeat s := InputBox('User input/Graphical', 'Enter the number 75000', '75000'); lIn...	Give a code snippet in #Delphi In this task, the goal is to input a string and the integer 75000, from graphical user interface. See also: User input/Text	christopher/rosetta-code
http://rosettacode.org/wiki/Roots_of_a_quadratic_function	Roots of a quadratic function	This task has been clarified. Its programming examples are in need of review to ensure that they still fit the requirements of the task. Write a program to find the roots of a quadratic equation, i.e., solve the equation a x 2 + b x + c = 0 {\displaystyle ax^{2}+bx+c=0} . Your program must correctly handle n...	#Go	Go	package main import ( "fmt" "math" ) func qr(a, b, c float64) ([]float64, []complex128) { d := bb-4ac switch { case d == 0: // single root return []float64{-b/(2a)}, nil case d > 0: // two real roots if b < 0 { d = math.Sqrt(d)-b } else...	Give a code snippet in #Go This task has been clarified. Its programming examples are in need of review to ensure that they still fit the requirements of the task. Write a program to find the roots of a quadratic equation, i.e., solve the equation a x 2 + b x + c = 0 {\displaystyle ax^{2}+bx+c=0} . Your pro...	christopher/rosetta-code
http://rosettacode.org/wiki/Character_codes	Character codes	Task Given a character value in your language, print its code (could be ASCII code, Unicode code, or whatever your language uses). Example The character 'a' (lowercase letter A) has a code of 97 in ASCII (as well as Unicode, as ASCII forms the beginning of Unicode). Conversely, given a code, print out...	#Sidef	Sidef	say 'a'.ord; # => 97 say 97.chr; # => 'a'	Give a code snippet in #Sidef Task Given a character value in your language, print its code (could be ASCII code, Unicode code, or whatever your language uses). Example The character 'a' (lowercase letter A) has a code of 97 in ASCII (as well as Unicode, as ASCII forms the beginning of Unicode). Conv...	christopher/rosetta-code
http://rosettacode.org/wiki/Inverted_syntax	Inverted syntax	Inverted syntax with conditional expressions In traditional syntax conditional expressions are usually shown before the action within a statement or code block: IF raining=true THEN needumbrella=true In inverted syntax, the action is listed before the conditional expression in the statement or code block: needumb...	#Z80_Assembly	Z80 Assembly	byte &EF,&BE word &BEEF	Give a code snippet in #Z80_Assembly Inverted syntax with conditional expressions In traditional syntax conditional expressions are usually shown before the action within a statement or code block: IF raining=true THEN needumbrella=true In inverted syntax, the action is listed before the conditional expression in ...	christopher/rosetta-code
http://rosettacode.org/wiki/Topological_sort	Topological sort	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 ...	#Python	Python	try: from functools import reduce except: pass data = { 'des_system_lib': set('std synopsys std_cell_lib des_system_lib dw02 dw01 ramlib ieee'.split()), 'dw01': set('ieee dw01 dware gtech'.split()), 'dw02': set('ieee dw02 dware'.split()), 'dw03': set('std ...	Give a code snippet in #Python 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 s...	christopher/rosetta-code
http://rosettacode.org/wiki/Doubly-linked_list/Traversal	Doubly-linked list/Traversal	Traverse from the beginning of a doubly-linked list to the end, and from the end to the beginning. See also Array Associative array: Creation, Iteration Collections Compound data type Doubly-linked list: Definition, Element definition, Element insertion, List Traversal, Element Removal Linked list Queue: Def...	#ALGOL_68	ALGOL 68	# Node struct - contains next and prev NODE pointers and DATA # MODE NODE = STRUCT( DATA data, REF NODE prev, REF NODE next ); # List structure - contains head and tail NODE pointers # MODE LIST = STRUCT( REF NODE head, REF NODE tail ); # --- PREPEND - Adds a node to the beginni...	Give a code snippet in #ALGOL_68 Traverse from the beginning of a doubly-linked list to the end, and from the end to the beginning. See also Array Associative array: Creation, Iteration Collections Compound data type Doubly-linked list: Definition, Element definition, Element insertion, List Traversal, Elemen...	christopher/rosetta-code
http://rosettacode.org/wiki/Compare_a_list_of_strings	Compare a list of strings	Task Given a list of arbitrarily many strings, show how to: test if they are all lexically equal test if every string is lexically less than the one after it (i.e. whether the list is in strict ascending order) Each of those two tests should result in a single true or false value, which could be used as t...	#SenseTalk	SenseTalk	analyze ["AA","BB","CC"] analyze ["AA","AA","AA"] analyze ["AA","CC","BB"] analyze ["AA","ACB","BB","CC"] analyze ["single_element"] to analyze aList put "List: " & aList put " " & (if allEqual(aList) then "IS" else "Is NOT") && "all equal" put " " & (if isAscending(aList) then "IS" else "Is NOT") && "strictly...	Give a code snippet in #SenseTalk Task Given a list of arbitrarily many strings, show how to: test if they are all lexically equal test if every string is lexically less than the one after it (i.e. whether the list is in strict ascending order) Each of those two tests should result in a single true or fa...	christopher/rosetta-code
http://rosettacode.org/wiki/Averages/Mode	Averages/Mode	Task[edit] Write a program to find the mode value of a collection. The case where the collection is empty may be ignored. Care must be taken to handle the case where the mode is non-unique. If it is not appropriate or possible to support a general collection, use a vector (array), if possible. If it is not appropriat...	#Rust	Rust	use std::collections::HashMap; fn main() { let mode_vec1 = mode(vec![ 1, 3, 6, 6, 6, 6, 7, 7, 12, 12, 17]); let mode_vec2 = mode(vec![ 1, 1, 2, 4, 4]); println!("Mode of vec1 is: {:?}", mode_vec1); println!("Mode of vec2 is: {:?}", mode_vec2); assert!( mode_vec1 == [6], "Error in mode calculat...	Give a code snippet in #Rust Task[edit] Write a program to find the mode value of a collection. The case where the collection is empty may be ignored. Care must be taken to handle the case where the mode is non-unique. If it is not appropriate or possible to support a general collection, use a vector (array), if pos...	christopher/rosetta-code
http://rosettacode.org/wiki/Esthetic_numbers	Esthetic numbers	An esthetic number is a positive integer where every adjacent digit differs from its neighbour by 1. E.G. 12 is an esthetic number. One and two differ by 1. 5654 is an esthetic number. Each digit is exactly 1 away from its neighbour. 890 is not an esthetic number. Nine and zero differ by 9. These examples are n...	#Pascal	Pascal	program Esthetic; {$IFDEF FPC} {$MODE DELPHI} {$OPTIMIZATION ON,ALL} {$codealign proc=16} {$ELSE} {$APPTYPE CONSOLE} {$ENDIF} uses sysutils,//IntToStr strutils;//Numb2USA aka commatize const ConvBase :array[0..15] of char= '0123456789ABCDEF'; maxBase = 16; type tErg = string[63]; tCnt = array[0..maxBas...	Give a code snippet in #Pascal An esthetic number is a positive integer where every adjacent digit differs from its neighbour by 1. E.G. 12 is an esthetic number. One and two differ by 1. 5654 is an esthetic number. Each digit is exactly 1 away from its neighbour. 890 is not an esthetic number. Nine and zero dif...	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...	#Clojure	Clojure	(defn paragraph [num] (str num " bottles of beer on the wall\n" num " bottles of beer\n" "Take one down, pass it around\n" (dec num) " bottles of beer on the wall.\n")) (defn lyrics [] (let [numbers (range 99 0 -1) paragraphs (map paragraph numbers)] (clojure.string/join "\n" pa...	Give a code snippet in #Clojure 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 ...	christopher/rosetta-code
http://rosettacode.org/wiki/Multiple_regression	Multiple regression	Task Given a set of data vectors in the following format: y = { y 1 , y 2 , . . . , ...	#Ursala	Ursala	regression_coefficients = lapack..dgelsd	Give a code snippet in #Ursala Task Given a set of data vectors in the following format: y = { y 1 , y 2 , . . ...	christopher/rosetta-code
http://rosettacode.org/wiki/Sum_of_squares	Sum of squares	Task Write a program to find the sum of squares of a numeric vector. The program should work on a zero-length vector (with an answer of 0). Related task Mean	#Python	Python	sum(x * x for x in [1, 2, 3, 4, 5]) # or sum(x ** 2 for x in [1, 2, 3, 4, 5]) # or sum(pow(x, 2) for x in [1, 2, 3, 4, 5])	Give a code snippet in #Python Task Write a program to find the sum of squares of a numeric vector. The program should work on a zero-length vector (with an answer of 0). Related task Mean	christopher/rosetta-code
http://rosettacode.org/wiki/Factors_of_an_integer	Factors of an integer	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 \|...	#OCaml	OCaml	let rec range = function 0 -> [] \| n -> range(n-1) @ [n] let factors n = List.filter (fun v -> (n mod v) = 0) (range n)	Give a code snippet in #OCaml 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 ...	christopher/rosetta-code
http://rosettacode.org/wiki/Fibonacci_word	Fibonacci word	The Fibonacci Word may be created in a manner analogous to the Fibonacci Sequence as described here: Define F_Word1 as 1 Define F_Word2 as 0 Form F_Word3 as F_Word2 concatenated with F_Word1 i.e.: 01 Form F_Wordn as F_Wordn-1 concatenated with F_wordn-...	#Seed7	Seed7	$ include "seed7_05.s7i"; include "float.s7i"; include "math.s7i"; const func float: entropy (in string: stri) is func result var float: entropy is 0.0; local var hash [char] integer: count is (hash [char] integer).value; var char: ch is ' '; var float: p is 0.0; begin for ch range stri ...	Give a code snippet in #Seed7 The Fibonacci Word may be created in a manner analogous to the Fibonacci Sequence as described here: Define F_Word1 as 1 Define F_Word2 as 0 Form F_Word3 as F_Word2 concatenated with F_Word1 i.e.: 01 Form F_Wordn as F_Wordn-1...	christopher/rosetta-code
http://rosettacode.org/wiki/Luhn_test_of_credit_card_numbers	Luhn test of credit card numbers	The Luhn test is used by some credit card companies to distinguish valid credit card numbers from what could be a random selection of digits. Those companies using credit card numbers that can be validated by the Luhn test have numbers that pass the following test: Reverse the order of the digits in the number. Tak...	#ZX_Spectrum_Basic	ZX Spectrum Basic	10 LET c$="49927398716": GO SUB 1000 20 LET c$="49927398717": GO SUB 1000 30 LET c$="1234567812345678": GO SUB 1000 40 LET c$="1234567812345670": GO SUB 1000 999 STOP 1000 REM ************* 1001 REM * LUHN TEST * 1002 REM ************* 1010 LET r$="" 1020 FOR i=LEN c$ TO 1 STEP -1 1030 LET r$=r$+c$(i) 1040 NEXT i 1050...	Give a code snippet in #ZX_Spectrum_Basic The Luhn test is used by some credit card companies to distinguish valid credit card numbers from what could be a random selection of digits. Those companies using credit card numbers that can be validated by the Luhn test have numbers that pass the following test: Reverse ...	christopher/rosetta-code
http://rosettacode.org/wiki/Add_a_variable_to_a_class_instance_at_runtime	Add a variable to a class instance at runtime	Demonstrate how to dynamically add variables to an object (a class instance) at runtime. This is useful when the methods/variables of an instance are based on a data file that isn't available until runtime. Hal Fulton gives an example of creating an OO CSV parser at An Exercise in Metaprogramming with Ruby. This is re...	#Ruby	Ruby	class Empty end e = Empty.new class << e attr_accessor :foo end e.foo = 1 puts e.foo # output: "1" f = Empty.new f.foo = 1 # raises NoMethodError	Give a code snippet in #Ruby Demonstrate how to dynamically add variables to an object (a class instance) at runtime. This is useful when the methods/variables of an instance are based on a data file that isn't available until runtime. Hal Fulton gives an example of creating an OO CSV parser at An Exercise in Metapro...	christopher/rosetta-code
http://rosettacode.org/wiki/Hostname	Hostname	Task Find the name of the host on which the routine is running.	#Emacs_Lisp	Emacs Lisp	(system-name)	Give a code snippet in #Emacs_Lisp Task Find the name of the host on which the routine is running.	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 ...	#Computer.2Fzero_Assembly	Computer/zero Assembly	loop: LDA y ; higher No. STA temp ADD x ; lower No. STA y LDA temp STA x LDA count SUB one BRZ done STA count JMP loop done: LDA y STP one: 1 count: 8 ; n = 10 x: 1 y: ...	Give a code snippet in #Computer.2Fzero_Assembly 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 recu...	christopher/rosetta-code
http://rosettacode.org/wiki/Reverse_a_string	Reverse a string	Task Take a string and reverse it. For example, "asdf" becomes "fdsa". Extra credit Preserve Unicode combining characters. For example, "as⃝df̅" becomes "f̅ds⃝a", not "̅fd⃝sa". Other tasks related to string operations: Metrics Array length String length Copy a string Empty string (assignment) Counting ...	#8th	8th	"abc" s:rev	Give a code snippet in #8th Task Take a string and reverse it. For example, "asdf" becomes "fdsa". Extra credit Preserve Unicode combining characters. For example, "as⃝df̅" becomes "f̅ds⃝a", not "̅fd⃝sa". Other tasks related to string operations: Metrics Array length String length Copy a string Empty s...	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...	#NS-HUBASIC	NS-HUBASIC	10 PRINT "NO,"A" ISN'T A MULTIPLE OF 6." 20 A=A+1 30 IF A-(A/6)*6<>0 THEN GOTO 10 40 PRINT "YES, 6 IS A MULTIPLE OF 6."	Give a code snippet in #NS-HUBASIC 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 Lo...	christopher/rosetta-code
http://rosettacode.org/wiki/Roots_of_a_function	Roots of a function	Task Create a program that finds and outputs the roots of a given function, range and (if applicable) step width. The program should identify whether the root is exact or approximate. For this task, use: ƒ(x) = x3 - 3x2 + 2x	#PL.2FI	PL/I	f: procedure (x) returns (float (18)); declare x float (18); return (x*3 - 3x*2 + 2x ); end f; declare eps float, (x, y) float (18); declare dx fixed decimal (15,13); eps = 1e-12; do dx = -5.03 to 5 by 0.1; x = dx; if sign(f(x)) ^= sign(f(dx+0.1)) then call locate_root; end; locate_root:...	Give a code snippet in #PL.2FI Task Create a program that finds and outputs the roots of a given function, range and (if applicable) step width. The program should identify whether the root is exact or approximate. For this task, use: ƒ(x) = x3 - 3x2 + 2x	christopher/rosetta-code
http://rosettacode.org/wiki/Singly-linked_list/Element_definition	Singly-linked list/Element definition	singly-linked list See also Array Associative array: Creation, Iteration Collections Compound data type Doubly-linked list: Definition, Element definition, Element insertion, List Traversal, Element Removal Linked list Queue: Definition, Usage Set Singly-linked list: Element definition, Element insertion, Lis...	#Clojure	Clojure	(cons 1 (cons 2 (cons 3 nil))) ; =>(1 2 3)	Give a code snippet in #Clojure singly-linked list See also Array Associative array: Creation, Iteration Collections Compound data type Doubly-linked list: Definition, Element definition, Element insertion, List Traversal, Element Removal Linked list Queue: Definition, Usage Set Singly-linked list: Element d...	christopher/rosetta-code
http://rosettacode.org/wiki/Heronian_triangles	Heronian triangles	Hero's formula for the area of a triangle given the length of its three sides a, b, and c is given by: A = s ( s − a ) ( s − b ) ( s − c ) , {\displaystyle A={\sqrt {s(s-a)(s-b)(s-c)}},} where s is half the perimeter of the triangle; that is, s = a + b + c 2 . {\displaystyle s...	#D	D	import std.stdio, std.math, std.range, std.algorithm, std.numeric, std.traits, std.typecons; double hero(in uint a, in uint b, in uint c) pure nothrow @safe @nogc { immutable s = (a + b + c) / 2.0; immutable a2 = s * (s - a) * (s - b) * (s - c); return (a2 > 0) ? a2.sqrt : 0.0; } bool isHeronian(in uint...	Give a code snippet in #D Hero's formula for the area of a triangle given the length of its three sides a, b, and c is given by: A = s ( s − a ) ( s − b ) ( s − c ) , {\displaystyle A={\sqrt {s(s-a)(s-b)(s-c)}},} where s is half the perimeter of the triangle; that is, s = a + b + ...	christopher/rosetta-code
http://rosettacode.org/wiki/Prime_conspiracy	Prime conspiracy	A recent discovery, quoted from Quantamagazine (March 13, 2016): Two mathematicians have uncovered a simple, previously unnoticed property of prime numbers — those numbers that are divisible only by 1 and themselves. Prime numbers, it seems, have decided preferences about the final digits of ...	#REXX	REXX	/REXX pgm shows a table of what last digit follows the previous last digit for N primes/ parse arg N . /N: the number of primes to be genned/ if N=='' \| N=="," then N= 1000000 /Not specified? Then use the default./ Np= N+1; w= length(N-1) ...	Give a code snippet in #REXX A recent discovery, quoted from Quantamagazine (March 13, 2016): Two mathematicians have uncovered a simple, previously unnoticed property of prime numbers — those numbers that are divisible only by 1 and themselves. Prime numbers, it seems, have decided preferenc...	christopher/rosetta-code
http://rosettacode.org/wiki/Phrase_reversals	Phrase reversals	Task Given a string of space separated words containing the following phrase: rosetta code phrase reversal Reverse the characters of the string. Reverse the characters of each individual word in the string, maintaining original word order within the string. Reverse the order of each word of the string, maintaini...	#Raku	Raku	my $s = 'rosetta code phrase reversal'; put 'Input : ', $s; put 'String reversed : ', $s.flip; put 'Each word reversed : ', $s.words».flip; put 'Word-order reversed : ', $s.words.reverse;	Give a code snippet in #Raku Task Given a string of space separated words containing the following phrase: rosetta code phrase reversal Reverse the characters of the string. Reverse the characters of each individual word in the string, maintaining original word order within the string. Reverse the order of each...	christopher/rosetta-code
http://rosettacode.org/wiki/Caesar_cipher	Caesar cipher	Task Implement a Caesar cipher, both encoding and decoding. The key is an integer from 1 to 25. This cipher rotates (either towards left or right) the letters of the alphabet (A to Z). The encoding replaces each letter with the 1st to 25th next letter in the alphabet (wrapping Z to A). So key 2 encrypts "HI" to...	#Stata	Stata	function caesar(s, k) { u = ascii(s) i = selectindex(u:>=65 :& u:<=90) if (length(i)>0) u[i] = mod(u[i]:+(k-65), 26):+65 i = selectindex(u:>=97 :& u:<=122) if (length(i)>0) u[i] = mod(u[i]:+(k-97), 26):+97 return(char(u)) } caesar("layout", 20) fusion	Give a code snippet in #Stata Task Implement a Caesar cipher, both encoding and decoding. The key is an integer from 1 to 25. This cipher rotates (either towards left or right) the letters of the alphabet (A to Z). The encoding replaces each letter with the 1st to 25th next letter in the alphabet (wrapping Z to...	christopher/rosetta-code
http://rosettacode.org/wiki/15_puzzle_game	15 puzzle game	Task Implement the Fifteen Puzzle Game. The 15-puzzle is also known as: Fifteen Puzzle Gem Puzzle Boss Puzzle Game of Fifteen Mystic Square 14-15 Puzzle and some others. Related Tasks 15 Puzzle Solver 16 Puzzle Game	#Picat	Picat	import util. main => Board = {{1,2,3,4}, {5,6,7,8}, {9,10,11,12}, {13,14,15,0}}, Goal = copy_term(Board), shuffle(Board), play(Board,Goal). shuffle(Board) => foreach (_ in 1..1000) R1 = random() mod 4 + 1, C1 = random() mod 4 + 1, ...	Give a code snippet in #Picat Task Implement the Fifteen Puzzle Game. The 15-puzzle is also known as: Fifteen Puzzle Gem Puzzle Boss Puzzle Game of Fifteen Mystic Square 14-15 Puzzle and some others. Related Tasks 15 Puzzle Solver 16 Puzzle Game	christopher/rosetta-code
http://rosettacode.org/wiki/Sum_to_100	Sum to 100	Task Find solutions to the sum to one hundred puzzle. Add (insert) the mathematical operators + or - (plus or minus) before any of the digits in the decimal numeric string 123456789 such that the resulting mathematical expression adds up to a particular sum (in this iconic case, ...	#Perl	Perl	#!/usr/bin/perl use warnings; use strict; use feature qw{ say }; my $string = '123456789'; my $length = length $string; my @possible_ops = ("" , '+', '-'); { my @ops; sub Next { return @ops = (0) x ($length) unless @ops; my $i = 0; while ($i < $length) { if ($ops[$i]++ ...	Give a code snippet in #Perl Task Find solutions to the sum to one hundred puzzle. Add (insert) the mathematical operators + or - (plus or minus) before any of the digits in the decimal numeric string 123456789 such that the resulting mathematical expression adds up to a particular ...	christopher/rosetta-code
http://rosettacode.org/wiki/Mayan_numerals	Mayan numerals	Task Present numbers using the Mayan numbering system (displaying the Mayan numerals in a cartouche). Mayan numbers Normally, Mayan numbers are written vertically (top─to─bottom) with the most significant numeral at the top (in the sense that decimal numbers are written left─to─right with the most signific...	#BASIC	BASIC	10 DEFINT A-Z: DIM L$(5) 15 FOR I=0 TO 5: READ L$(I): NEXT I 20 LINE INPUT I$ 30 M=LEN(I$): DIM D(M) 40 FOR I=1 TO M: D(I)=VAL(MID$(I$,I,1)): NEXT I 50 FOR J=M-1 TO 1 STEP -1 60 FOR I=1 TO J 70 D(I+1) = D(I+1) + 10*(D(I) AND 1) 80 D(I) = D(I)\2 90 NEXT I,J 100 S=1 110 IF D(S)=0 AND S<M THEN S=S+1: GOTO 110 120 FOR I=S ...	Give a code snippet in #BASIC Task Present numbers using the Mayan numbering system (displaying the Mayan numerals in a cartouche). Mayan numbers Normally, Mayan numbers are written vertically (top─to─bottom) with the most significant numeral at the top (in the sense that decimal numbers are written left─...	christopher/rosetta-code
http://rosettacode.org/wiki/Variable_size/Set	Variable size/Set	Task Demonstrate how to specify the minimum size of a variable or a data type.	#C.2B.2B	C++	#include <boost/cstdint.hpp> boost::int_least32_t foo;	Give a code snippet in #C.2B.2B Task Demonstrate how to specify the minimum size of a variable or a data type.	christopher/rosetta-code
http://rosettacode.org/wiki/Perfect_numbers	Perfect numbers	Write a function which says whether a number is perfect. A perfect number is a positive integer that is the sum of its proper positive divisors excluding the number itself. Equivalently, a perfect number is a number that is half the sum of all of its positive divisors (including itself). Note: The faster Luca...	#PureBasic	PureBasic	Procedure is_Perfect_number(n) Protected summa, i=1, result=#False Repeat If Not n%i summa+i EndIf i+1 Until i>=n If summa=n result=#True EndIf ProcedureReturn result EndProcedure	Give a code snippet in #PureBasic Write a function which says whether a number is perfect. A perfect number is a positive integer that is the sum of its proper positive divisors excluding the number itself. Equivalently, a perfect number is a number that is half the sum of all of its positive divisors (including it...	christopher/rosetta-code
http://rosettacode.org/wiki/Best_shuffle	Best shuffle	Task Shuffle the characters of a string in such a way that as many of the character values are in a different position as possible. A shuffle that produces a randomized result among the best choices is to be preferred. A deterministic approach that produces the same sequence every time is acceptable as an alternative...	#Bracmat	Bracmat	( shuffle = m car cdr todo a z count string . !arg:(@(?:%?car ?cdr).?todo) & !Count:?count & ( @( !todo : ?a (%@:~!car:?m) ( ?z & shuffle$(!cdr.str$(!a !z)) : (<!count:...	Give a code snippet in #Bracmat Task Shuffle the characters of a string in such a way that as many of the character values are in a different position as possible. A shuffle that produces a randomized result among the best choices is to be preferred. A deterministic approach that produces the same sequence every tim...	christopher/rosetta-code
http://rosettacode.org/wiki/String_append	String append	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 \|...	#EasyLang	EasyLang	a$ = "hello" a$ &= " world" print a$	Give a code snippet in #EasyLang 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 Operatio...	christopher/rosetta-code
http://rosettacode.org/wiki/Kernighans_large_earthquake_problem	Kernighans large earthquake problem	Brian Kernighan, in a lecture at the University of Nottingham, described a problem on which this task is based. Problem You are given a a data file of thousands of lines; each of three `whitespace` separated fields: a date, a one word name and the magnitude of the event. Example lines from the file would be lines li...	#Bash	Bash	#!/bin/bash while read line do [[ ${line##* } =~ ^([7-9]\|6\.0[1-9]).$ ]] && echo "$line" done < data.txt	Give a code snippet in #Bash Brian Kernighan, in a lecture at the University of Nottingham, described a problem on which this task is based. Problem You are given a a data file of thousands of lines; each of three `whitespace` separated fields: a date, a one word name and the magnitude of the event. Example lines f...	christopher/rosetta-code

http://rosettacode.org/wiki/FASTA_format

FASTA format

In bioinformatics, long character strings are often encoded in a format called FASTA. A FASTA file can contain several strings, each identified by a name marked by a > (greater than) character at the beginning of the line. Task Write a program that reads a FASTA file such as: >Rosetta_Example_1 THERECANBENOSPACE ...

#Action.21

Action!

PROC ReadFastaFile(CHAR ARRAY fname) CHAR ARRAY line(256) CHAR ARRAY tmp(256) BYTE newLine,dev=[1] newLine=0 Close(dev) Open(dev,fname,4) WHILE Eof(dev)=0 DO InputSD(dev,line) IF line(0)>0 AND line(1)='> THEN IF newLine THEN PutE() FI newLine=1 SCopyS(tmp,line,2...

Give a code snippet in #Action.21 In bioinformatics, long character strings are often encoded in a format called FASTA. A FASTA file can contain several strings, each identified by a name marked by a > (greater than) character at the beginning of the line. Task Write a program that reads a FASTA file such as: >R...

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, ...

#Bc

Bc

0 ^ 0

Give a code snippet in #Bc 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/Largest_number_divisible_by_its_digits

Largest number divisible by its digits

Task Find the largest base 10 integer whose digits are all different, and is evenly divisible by each of its individual digits. These numbers are also known as Lynch-Bell numbers, numbers n such that the (base ten) digits are all different (and do not include zero) and n is divisible by each of it...

#AWK

AWK

# Usage: gawk -f LARGEST_NUMBER_DIVISIBLE_BY_ITS_DIGITS_10.AWK BEGIN { base = 10 comdiv = 12 startn = 9876543 stopn = 1000000 solve(startn, stopn) } function solve(startn, stopn, n, d) { for (n = startn - startn % comdiv; n > stopn; n -= comdiv) { if (hasuniqedigits(n)) { ...

Give a code snippet in #AWK Task Find the largest base 10 integer whose digits are all different, and is evenly divisible by each of its individual digits. These numbers are also known as Lynch-Bell numbers, numbers n such that the (base ten) digits are all different (and do not include zero) and n...

christopher/rosetta-code

http://rosettacode.org/wiki/Fermat_numbers

Fermat numbers

In mathematics, a Fermat number, named after Pierre de Fermat who first studied them, is a positive integer of the form Fn = 22n + 1 where n is a non-negative integer. Despite the simplicity of generating Fermat numbers, they have some powerful mathematical properties and are extensively used in cryptography & pseudo-...

#Python

Python

def factors(x): factors = [] i = 2 s = int(x ** 0.5) while i < s: if x % i == 0: factors.append(i) x = int(x / i) s = int(x ** 0.5) i += 1 factors.append(x) return factors print("First 10 Fermat numbers:") for i in range(10): fermat = 2 *...

Give a code snippet in #Python In mathematics, a Fermat number, named after Pierre de Fermat who first studied them, is a positive integer of the form Fn = 22n + 1 where n is a non-negative integer. Despite the simplicity of generating Fermat numbers, they have some powerful mathematical properties and are extensivel...

christopher/rosetta-code

http://rosettacode.org/wiki/Cumulative_standard_deviation

Cumulative standard deviation

Task[edit] Write a stateful function, class, generator or co-routine that takes a series of floating point numbers, one at a time, and returns the running standard deviation of the series. The task implementation should use the most natural programming style of those listed for the function in the implementation langu...

#360_Assembly

360 Assembly

******** Standard deviation of a population STDDEV CSECT USING STDDEV,R13 SAVEAREA B STM-SAVEAREA(R15) DC 17F'0' DC CL8'STDDEV' STM STM R14,R12,12(R13) ST R13,4(R15) ST R15,8(R13) LR R13,R15 SR R8,R8 s=0 ...

Give a code snippet in #360_Assembly Task[edit] Write a stateful function, class, generator or co-routine that takes a series of floating point numbers, one at a time, and returns the running standard deviation of the series. The task implementation should use the most natural programming style of those listed for th...

christopher/rosetta-code

http://rosettacode.org/wiki/Pinstripe/Display

Pinstripe/Display

Sample image The task is to demonstrate the creation of a series of vertical pinstripes across the entire width of the display. in the first quarter the pinstripes should alternate one pixel white, one pixel black = 1 pixel wide vertical pinestripes Quarter of the way down the display, we can switch to a wider 2 pi...

#Java

Java

import java.awt.*; import javax.swing.*; public class PinstripeDisplay extends JPanel { final int bands = 4; public PinstripeDisplay() { setPreferredSize(new Dimension(900, 600)); } @Override public void paintComponent(Graphics g) { super.paintComponent(g); int h = ge...

Give a code snippet in #Java Sample image The task is to demonstrate the creation of a series of vertical pinstripes across the entire width of the display. in the first quarter the pinstripes should alternate one pixel white, one pixel black = 1 pixel wide vertical pinestripes Quarter of the way down the display,...

christopher/rosetta-code

http://rosettacode.org/wiki/Merge_and_aggregate_datasets

Merge and aggregate datasets

Merge and aggregate datasets Task Merge and aggregate two datasets as provided in .csv files into a new resulting dataset. Use the appropriate methods and data structures depending on the programming language. Use the most common libraries only when built-in functionality is not sufficient. Note Either lo...

#Phix

Phix

constant patients_txt = split(""" PATIENT_ID,LASTNAME 1001,Hopper 4004,Wirth 3003,Kemeny 2002,Gosling 5005,Kurtz""",'\n'), visits_txt = split(""" PATIENT_ID,VISIT_DATE,SCORE 2002,2020-09-10,6.8 1001,2020-09-17,5.5 4004,2020-09-24,8.4 2002,2020-10-08, 1001,,6.6 3003,2020-11-12, 4004,2020-11-05,7.0 1001,2020-11-...

Give a code snippet in #Phix Merge and aggregate datasets Task Merge and aggregate two datasets as provided in .csv files into a new resulting dataset. Use the appropriate methods and data structures depending on the programming language. Use the most common libraries only when built-in functionality is not ...

christopher/rosetta-code

http://rosettacode.org/wiki/HTTP

HTTP

Task Access and print a URL's content (the located resource) to the console. There is a separate task for HTTPS Requests.

#UNIX_Shell

UNIX Shell

curl -s -L http://rosettacode.org/

Give a code snippet in #UNIX_Shell Task Access and print a URL's content (the located resource) to the console. There is a separate task for HTTPS Requests.

christopher/rosetta-code

http://rosettacode.org/wiki/Rhonda_numbers

Rhonda numbers

A positive integer n is said to be a Rhonda number to base b if the product of the base b digits of n is equal to b times the sum of n's prime factors. These numbers were named by Kevin Brown after an acquaintance of his whose residence number was 25662, a member of the base 10 numbers with this property. 25662 is ...

#Perl

Perl

use strict; use warnings; use feature 'say'; use ntheory qw<is_prime factor vecsum vecprod todigitstring todigits>; sub rhonda { my($b, $cnt) = @_; my(@r,$n); while (++$n) { push @r, $n if ($b * vecsum factor($n)) == vecprod todigits($n,$b); return @r if $cnt == @r; } } for my $b (gr...

Give a code snippet in #Perl A positive integer n is said to be a Rhonda number to base b if the product of the base b digits of n is equal to b times the sum of n's prime factors. These numbers were named by Kevin Brown after an acquaintance of his whose residence number was 25662, a member of the base 10 numbers w...

christopher/rosetta-code

http://rosettacode.org/wiki/Sieve_of_Eratosthenes

Sieve of Eratosthenes

This task has been clarified. Its programming examples are in need of review to ensure that they still fit the requirements of the task. The Sieve of Eratosthenes is a simple algorithm that finds the prime numbers up to a given integer. Task Implement the Sieve of Eratosthenes algorithm, with the only allowed...

#Batch_File

Batch File

:: Sieve of Eratosthenes for Rosetta Code - PG @echo off setlocal ENABLEDELAYEDEXPANSION setlocal ENABLEEXTENSIONS rem echo on set /p n=limit: rem set n=100 for /L %%i in (1,1,%n%) do set crible.%%i=1 for /L %%i in (2,1,%n%) do ( if !crible.%%i! EQU 1 ( set /A w = %%i * 2 for /L %%j in (!w!,%%i,%n%) do ( ...

Give a code snippet in #Batch_File This task has been clarified. Its programming examples are in need of review to ensure that they still fit the requirements of the task. The Sieve of Eratosthenes is a simple algorithm that finds the prime numbers up to a given integer. Task Implement the Sieve of Eratosthene...

christopher/rosetta-code

http://rosettacode.org/wiki/Unbias_a_random_generator

Unbias a random generator

P 1 {\displaystyle P_{1}} P 0 {\displaystyle P_{0}} P 1 {\displaystyle P_{1}} P 0 {\displaystyle P_{0}} P 0 {\displaystyle P_{0}} P 1 {\displaystyle P_{1}} Task details Use your language's random number generator to create a function/method/sub...

#F.23

F#

open System let random = Random() let randN = random.Next >> (=)0 >> Convert.ToInt32 let rec unbiased n = let a = randN n if a <> randN n then a else unbiased n [<EntryPoint>] let main argv = let n = if argv.Length > 0 then UInt32.Parse(argv.[0]) |> int else 100000 for b = 3 to 6 do let ...

Give a code snippet in #F.23 P 1 {\displaystyle P_{1}} P 0 {\displaystyle P_{0}} P 1 {\displaystyle P_{1}} P 0 {\displaystyle P_{0}} P 0 {\displaystyle P_{0}} P 1 {\displaystyle P_{1}} Task details Use your language's random number generator t...

christopher/rosetta-code

http://rosettacode.org/wiki/Determine_sentence_type

Determine sentence type

Use these sentences: "hi there, how are you today? I'd like to present to you the washing machine 9001. You have been nominated to win one of these! Just make sure you don't break it." Task Search for the last used punctuation in a sentence, and determine its type according to its punctuation. Output one of these le...

#FreeBASIC

FreeBASIC

function sentype( byref s as string ) as string 'determines the sentence type of the first sentence in the string 'returns "E" for an exclamation, "Q" for a question, "S" for serious 'and "N" for neutral. 'modifies the string to remove the first sentence for i as uinteger = 1 to len(s) if mi...

Give a code snippet in #FreeBASIC Use these sentences: "hi there, how are you today? I'd like to present to you the washing machine 9001. You have been nominated to win one of these! Just make sure you don't break it." Task Search for the last used punctuation in a sentence, and determine its type according to its p...

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 ...

#Perl

Perl

use strict; use warnings; use List::Util 'min'; # If you want the large output, uncomment either the one line # marked (1) or the two lines marked (2) #use Math::GMP qw/:constant/; # (1) uncomment this to use Math::GMP #use Math::GMPz; # (2) uncomment this plus later line for Math::GMPz s...

Give a code snippet in #Perl 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 numbe...

christopher/rosetta-code

http://rosettacode.org/wiki/Sudoku

Sudoku

Task Solve a partially filled-in normal 9x9 Sudoku grid and display the result in a human-readable format. references Algorithmics of Sudoku may help implement this. Python Sudoku Solver Computerphile video.

#Tcl

Tcl

package require Tcl 8.6 oo::class create Sudoku { variable idata method clear {} { for {set y 0} {$y < 9} {incr y} { for {set x 0} {$x < 9} {incr x} { my set $x $y {} } } } method load {data} { set error "data must be a 9-element list, each element also being a\ list of 9 numbers from...

Give a code snippet in #Tcl Task Solve a partially filled-in normal 9x9 Sudoku grid and display the result in a human-readable format. references Algorithmics of Sudoku may help implement this. Python Sudoku Solver Computerphile video.

christopher/rosetta-code

http://rosettacode.org/wiki/Arithmetic-geometric_mean

Arithmetic-geometric mean

This page uses content from Wikipedia. The original article was at Arithmetic-geometric mean. 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 Write a function to compute the arithmetic-geomet...

#Factor

Factor

USING: kernel math math.functions prettyprint ; IN: rosetta-code.arithmetic-geometric-mean : agm ( a g -- a' g' ) 2dup [ + 0.5 * ] 2dip * sqrt ; 1 1 2 sqrt / [ 2dup - 1e-15 > ] [ agm ] while drop .

Give a code snippet in #Factor This page uses content from Wikipedia. The original article was at Arithmetic-geometric mean. 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 Write a function ...

christopher/rosetta-code

http://rosettacode.org/wiki/Search_a_list

Search a list

Task[edit] Find the index of a string (needle) in an indexable, ordered collection of strings (haystack). Raise an exception if the needle is missing. If there is more than one occurrence then return the smallest index to the needle. Extra credit Return the largest index to a needle that has multiple occurrences in ...

#Erlang

Erlang

-module(index). -export([main/0]). main() -> Haystack = ["Zig","Zag","Wally","Ronald","Bush","Krusty","Charlie","Bush","Bozo"], Needles = ["Washington","Bush"], lists:foreach(fun ?MODULE:print/1, [{N,pos(N, Haystack)} || N <- Needles]). pos(Needle, Haystack) -> pos(Needle, Haystack, 1). pos(_, [], _) ->...

Give a code snippet in #Erlang Task[edit] Find the index of a string (needle) in an indexable, ordered collection of strings (haystack). Raise an exception if the needle is missing. If there is more than one occurrence then return the smallest index to the needle. Extra credit Return the largest index to a needle t...

christopher/rosetta-code

http://rosettacode.org/wiki/Convert_seconds_to_compound_duration

Convert seconds to compound duration

Task Write a function or program which: takes a positive integer representing a duration in seconds as input (e.g., 100), and returns a string which shows the same duration decomposed into: weeks, days, hours, minutes, and seconds. This is detailed below (e.g., "2 hr, 59 sec"). Demonstrat...

#AWK

AWK

# syntax: GAWK -f CONVERT_SECONDS_TO_COMPOUND_DURATION.AWK BEGIN { n = split("7259 86400 6000000 0 1 60 3600 604799 604800 694861",arr," ") for (i=1; i<=n; i++) { printf("%9s %s\n",arr[i],howlong(arr[i])) } exit(0) } function howlong(seconds, n_day,n_hour,n_min,n_sec,n_week,str,x) { if (sec...

Give a code snippet in #AWK Task Write a function or program which: takes a positive integer representing a duration in seconds as input (e.g., 100), and returns a string which shows the same duration decomposed into: weeks, days, hours, minutes, and seconds. This is detailed below (e.g., "...

christopher/rosetta-code

http://rosettacode.org/wiki/Perfect_numbers

Perfect numbers

Write a function which says whether a number is perfect. A perfect number is a positive integer that is the sum of its proper positive divisors excluding the number itself. Equivalently, a perfect number is a number that is half the sum of all of its positive divisors (including itself). Note: The faster Luca...

#M2000_Interpreter

M2000 Interpreter

Module PerfectNumbers { Function Is_Perfect(n as decimal) { s=1 : sN=Sqrt(n) last= n=sN*sN t=n If n mod 2=0 then s+=2+n div 2 i=3 : sN-- While i<sN { if n mod i=0 then t=n div i :i=max.data(n div t, i): s+=t+ i i++ ...

Give a code snippet in #M2000_Interpreter Write a function which says whether a number is perfect. A perfect number is a positive integer that is the sum of its proper positive divisors excluding the number itself. Equivalently, a perfect number is a number that is half the sum of all of its positive divisors (incl...

christopher/rosetta-code

http://rosettacode.org/wiki/Factors_of_an_integer

Factors of an integer

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 |...

#ProDOS

ProDOS

editvar /newvar /value=a /userinput=1 /title=Enter an integer: do /delimspaces %% -a- >b printline Factors of -a-: -b-

Give a code snippet in #ProDOS 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...

christopher/rosetta-code

http://rosettacode.org/wiki/Text_processing/2

Text processing/2

The following task concerns data that came from a pollution monitoring station with twenty-four instruments monitoring twenty-four aspects of pollution in the air. Periodically a record is added to the file, each record being a line of 49 fields separated by white-space, which can be one or more space or tab characters...

#Kotlin

Kotlin

// version 1.2.31 import java.io.File fun main(args: Array<String>) { val rx = Regex("""\s+""") val file = File("readings.txt") var count = 0 var invalid = 0 var allGood = 0 var map = mutableMapOf<String, Int>() file.forEachLine { line -> count++ val fields = line.split(r...

Give a code snippet in #Kotlin The following task concerns data that came from a pollution monitoring station with twenty-four instruments monitoring twenty-four aspects of pollution in the air. Periodically a record is added to the file, each record being a line of 49 fields separated by white-space, which can be one...

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

#SPL

SPL

#.output("Hello world!")

Give a code snippet in #SPL 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/Anti-primes

Anti-primes

The anti-primes (or highly composite numbers, sequence A002182 in the OEIS) are the natural numbers with more factors than any smaller than itself. Task Generate and show here, the first twenty anti-primes. Related tasks Factors of an integer Sieve of Eratosthenes

#Ruby

Ruby

require 'prime' def num_divisors(n) n.prime_division.inject(1){|prod, (_p,n)| prod *= (n + 1) } end anti_primes = Enumerator.new do |y| # y is the yielder max = 0 y << 1 # yield 1 2.step(nil,2) do |candidate| # nil is taken as Infinity num = num_divisors(candidate) ...

Give a code snippet in #Ruby The anti-primes (or highly composite numbers, sequence A002182 in the OEIS) are the natural numbers with more factors than any smaller than itself. Task Generate and show here, the first twenty anti-primes. Related tasks Factors of an integer Sieve of Eratosthenes

christopher/rosetta-code

http://rosettacode.org/wiki/Even_or_odd

Even or odd

Task Test whether an integer is even or odd. There is more than one way to solve this task: Use the even and odd predicates, if the language provides them. Check the least significant digit. With binary integers, i bitwise-and 1 equals 0 iff i is even, or equals 1 iff i is odd. Divide i by 2. The remainder equals...

#Ruby

Ruby

print "evens: " p -5.upto(5).select(&:even?) print "odds: " p -5.upto(5).select(&:odd?)

Give a code snippet in #Ruby Task Test whether an integer is even or odd. There is more than one way to solve this task: Use the even and odd predicates, if the language provides them. Check the least significant digit. With binary integers, i bitwise-and 1 equals 0 iff i is even, or equals 1 iff i is odd. Divid...

christopher/rosetta-code

http://rosettacode.org/wiki/Sum_multiples_of_3_and_5

Sum multiples of 3 and 5

Task The objective is to write a function that finds the sum of all positive multiples of 3 or 5 below n. Show output for n = 1000. This is is the same as Project Euler problem 1. Extra credit: do this efficiently for n = 1e20 or higher.

#jq

jq

def sum_multiples(d): ((./d) | floor) | (d * . * (.+1))/2 ; # Sum of multiples of a or b that are less than . (the input) def task(a;b): . - 1 | sum_multiples(a) + sum_multiples(b) - sum_multiples(a*b);

Give a code snippet in #jq Task The objective is to write a function that finds the sum of all positive multiples of 3 or 5 below n. Show output for n = 1000. This is is the same as Project Euler problem 1. Extra credit: do this efficiently for n = 1e20 or higher.

christopher/rosetta-code

http://rosettacode.org/wiki/Fractal_tree

Fractal tree

Generate and draw a fractal tree. Draw the trunk At the end of the trunk, split by some angle and draw two branches Repeat at the end of each branch until a sufficient level of branching is reached Related tasks Pythagoras Tree

#Scala

Scala

import swing._ import java.awt.{RenderingHints, BasicStroke, Color} object FractalTree extends SimpleSwingApplication { val DEPTH = 9 def top = new MainFrame { contents = new Panel { preferredSize = new Dimension(600, 500) override def paintComponent(g: Graphics2D) { draw(300, 460, -90...

Give a code snippet in #Scala Generate and draw a fractal tree. Draw the trunk At the end of the trunk, split by some angle and draw two branches Repeat at the end of each branch until a sufficient level of branching is reached Related tasks Pythagoras Tree

christopher/rosetta-code

http://rosettacode.org/wiki/Floyd-Warshall_algorithm

Floyd-Warshall algorithm

The Floyd–Warshall algorithm is an algorithm for finding shortest paths in a weighted graph with positive or negative edge weights. Task Find the lengths of the shortest paths between all pairs of vertices of the given directed graph. Your code may assume that the input has already been checked for loops, parallel ...

#Scheme

Scheme

;;; Floyd-Warshall algorithm. ;;; ;;; See https://en.wikipedia.org/w/index.php?title=Floyd%E2%80%93Warshall_algorithm&oldid=1082310013 ;;; (import (scheme base)) (import (scheme cxr)) (import (scheme write)) ;;; ;;; A square array will be represented by a cons-pair: ;;; ;;; (vector-of-length n-squared . n) ;;; ;...

Give a code snippet in #Scheme The Floyd–Warshall algorithm is an algorithm for finding shortest paths in a weighted graph with positive or negative edge weights. Task Find the lengths of the shortest paths between all pairs of vertices of the given directed graph. Your code may assume that the input has already b...

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 ...

#JavaScript

JavaScript

var fso = new ActiveXObject("Scripting.FileSystemObject"); var ForReading = 1, ForWriting = 2; var f_in = fso.OpenTextFile('input.txt', ForReading); var f_out = fso.OpenTextFile('output.txt', ForWriting, true); // for small files: // f_out.Write( f_in.ReadAll() ); while ( ! f_in.AtEndOfStream) { // ReadLine() ...

Give a code snippet in #JavaScript 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 f...

christopher/rosetta-code

http://rosettacode.org/wiki/Symmetric_difference

Symmetric difference

Task Given two sets A and B, compute ( A ∖ B ) ∪ ( B ∖ A ) . {\displaystyle (A\setminus B)\cup (B\setminus A).} That is, enumerate the items that are in A or B but not both. This set is called the symmetric difference of A and B. In other words: ( A ∪ B ) ∖ ( A ∩ B ) {\displaystyle (A\cup B)\setminus (A...

#REBOL

REBOL

a: [John Serena Bob Mary Serena] b: [Jim Mary John Jim Bob] difference a b

Give a code snippet in #REBOL Task Given two sets A and B, compute ( A ∖ B ) ∪ ( B ∖ A ) . {\displaystyle (A\setminus B)\cup (B\setminus A).} That is, enumerate the items that are in A or B but not both. This set is called the symmetric difference of A and B. In other words: ( A ∪ B ) ∖ ( A ∩ B ) {\dis...

christopher/rosetta-code

http://rosettacode.org/wiki/Runtime_evaluation

Runtime evaluation

Task Demonstrate a language's ability for programs to execute code written in the language provided at runtime. Show what kind of program fragments are permitted (e.g. expressions vs. statements), and how to get values in and out (e.g. environments, arguments, return values), if applicable what lexical/static environ...

#Groovy

Groovy

[2011, 2016, 2022, 2033, 2039, 2044, 2050, 2061, 2067, 2072, 2078, 2089, 2095, 2101, 2107, 2112, 2118]

Give a code snippet in #Groovy Task Demonstrate a language's ability for programs to execute code written in the language provided at runtime. Show what kind of program fragments are permitted (e.g. expressions vs. statements), and how to get values in and out (e.g. environments, arguments, return values), if applic...

christopher/rosetta-code

http://rosettacode.org/wiki/Abundant,_deficient_and_perfect_number_classifications

Abundant, deficient and perfect number classifications

These define three classifications of positive integers based on their proper divisors. Let P(n) be the sum of the proper divisors of n where the proper divisors are all positive divisors of n other than n itself. if P(n) < n then n is classed as deficient (OEIS A005100). if P(n)...

#Oforth

Oforth

import: mapping Integer method: properDivs -- [] self 2 / seq filter( #[ self swap mod 0 == ] ) ; : numberClasses | i deficient perfect s | 0 0 ->deficient ->perfect 0 20000 loop: i [ 0 #+ i properDivs apply ->s s i < ifTrue: [ deficient 1+ ->deficient continue ] s i == ifTrue: [ perf...

Give a code snippet in #Oforth These define three classifications of positive integers based on their proper divisors. Let P(n) be the sum of the proper divisors of n where the proper divisors are all positive divisors of n other than n itself. if P(n) < n then n is classed as deficien...

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.

#Rust

Rust

fn main() { let nums = [1,2,39,34,20]; println!("{:?}", nums.iter().max()); println!("{}", nums.iter().max().unwrap()); }

Give a code snippet in #Rust 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/100_doors

100 doors

There are 100 doors in a row that are all initially closed. You make 100 passes by the doors. The first time through, visit every door and toggle the door (if the door is closed, open it; if it is open, close it). The second time, only visit every 2nd door (door #2, #4, #6, ...), and toggle it. The third...

#Dc

Dc

## NB: This code uses the dc command "r" via register "r". ## You may comment out the unwanted version. [SxSyLxLy]sr # this should work with every "dc" [r]sr # GNU dc can exchange top 2 stack values by "r" ## Now use "lrx" instead of "r" ... 0k # we work without decimal places [q]sq ...

Give a code snippet in #Dc There are 100 doors in a row that are all initially closed. You make 100 passes by the doors. The first time through, visit every door and toggle the door (if the door is closed, open it; if it is open, close it). The second time, only visit every 2nd door (door #2, #4, #6, ...),...

christopher/rosetta-code

http://rosettacode.org/wiki/Secure_temporary_file

Secure temporary file

Task Create a temporary file, securely and exclusively (opening it such that there are no possible race conditions). It's fine assuming local filesystem semantics (NFS or other networking filesystems can have signficantly more complicated semantics for satisfying the "no race conditions" criteria). The function shou...

#TUSCRIPT

TUSCRIPT

$$ MODE TUSCRIPT tmpfile="test.txt" ERROR/STOP CREATE (tmpfile,seq-E,-std-) text="hello world" FILE $tmpfile = text - tmpfile "test.txt" can only be accessed by one user an will be deleted upon programm termination

Give a code snippet in #TUSCRIPT Task Create a temporary file, securely and exclusively (opening it such that there are no possible race conditions). It's fine assuming local filesystem semantics (NFS or other networking filesystems can have signficantly more complicated semantics for satisfying the "no race conditi...

christopher/rosetta-code

http://rosettacode.org/wiki/Real_constants_and_functions

Real constants and functions

Task Show how to use the following math constants and functions in your language (if not available, note it): e (base of the natural logarithm) π {\displaystyle \pi } square root logarithm (any base allowed) exponential (ex ) absolute value (a.k.a. "magnitude") floor (largest ...

#ERRE

ERRE

PROGRAM R_C_F FUNCTION CEILING(X) CEILING=INT(X)-(X-INT(X)>0) END FUNCTION FUNCTION FLOOR(X) FLOOR=INT(X) END FUNCTION BEGIN PRINT(EXP(1)) ! e not available PRINT(π) ! pi is available or .... PRINT(4*ATN(1)) ! .... equal to X=12.345 Y=1.23 ...

Give a code snippet in #ERRE Task Show how to use the following math constants and functions in your language (if not available, note it): e (base of the natural logarithm) π {\displaystyle \pi } square root logarithm (any base allowed) exponential (ex ) absolute value (a.k.a. "ma...

christopher/rosetta-code

http://rosettacode.org/wiki/Date_manipulation

Date manipulation

Task Given the date string "March 7 2009 7:30pm EST", output the time 12 hours later in any human-readable format. As extra credit, display the resulting time in a time zone different from your own.

#zkl

zkl

var Date=Time.Date; fcn add12h(dt){ re:=RegExp(0'|(\w+)\s+(\d+)\s+(\d+)\ +(.+)\s|); re.search(dt); _,M,D,Y,hms:=re.matched; //"March","7","2009","7:30pm" M=Date.monthNames.index(M); //3 h,m,s:=Date.parseTime(hms); //19,30,0 dti:=T(Y,M,D, h,m,s).apply("toInt"); Y,M,D, h,m,s=Date.addHMS(dti,12); ...

Give a code snippet in #zkl Task Given the date string "March 7 2009 7:30pm EST", output the time 12 hours later in any human-readable format. As extra credit, display the resulting time in a time zone different from your own.

christopher/rosetta-code

http://rosettacode.org/wiki/Execute_Brain****

Execute Brain****

Execute Brain**** is an implementation of Brainf***. Other implementations of Brainf***. RCBF is a set of Brainf*** compilers and interpreters written for Rosetta Code in a variety of languages. Below are links to each of the versions of RCBF. An implementation need only properly implement the following instructions:...

#Ol

Ol

(define (bf program stack-length) (let ((program (string-append program "]")); end (program-counter 0) (stack (make-bytevector stack-length 0)) (stack-pointer 0)) (letrec ((skip (lambda (PC sp in) (let loop ((pc PC) (sp sp) (in in)) ...

Give a code snippet in #Ol Execute Brain**** is an implementation of Brainf***. Other implementations of Brainf***. RCBF is a set of Brainf*** compilers and interpreters written for Rosetta Code in a variety of languages. Below are links to each of the versions of RCBF. An implementation need only properly implement...

christopher/rosetta-code

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

Averages/Mode

Task[edit] Write a program to find the mode value of a collection. The case where the collection is empty may be ignored. Care must be taken to handle the case where the mode is non-unique. If it is not appropriate or possible to support a general collection, use a vector (array), if possible. If it is not appropriat...

#Python

Python

>>> from collections import defaultdict >>> def modes(values): count = defaultdict(int) for v in values: count[v] +=1 best = max(count.values()) return [k for k,v in count.items() if v == best] >>> modes([1,3,6,6,6,6,7,7,12,12,17]) [6] >>> modes((1,1,2,4,4)) [1, 4]

Give a code snippet in #Python Task[edit] Write a program to find the mode value of a collection. The case where the collection is empty may be ignored. Care must be taken to handle the case where the mode is non-unique. If it is not appropriate or possible to support a general collection, use a vector (array), if p...

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...

#Extended_BrainF.2A.2A.2A

Extended BrainF***

#light let rec bottles n = let (before, after) = match n with | 1 -> ("bottle", "bottles") | 2 -> ("bottles", "bottle") | n -> ("bottles", "bottles") printfn "%d %s of beer on the wall" n before printfn "%d %s of beer" n before ...

Give a code snippet in #Extended_BrainF.2A.2A.2A 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 be...

christopher/rosetta-code

http://rosettacode.org/wiki/Monty_Hall_problem

Monty Hall problem

Suppose you're on a game show and you're given the choice of three doors. Behind one door is a car; behind the others, goats. The car and the goats were placed randomly behind the doors before the show. Rules of the game After you have chosen a door, the door remains closed for the time being. The game show hos...

#Pascal

Pascal

program MontyHall; uses sysutils; const NumGames = 1000; {Randomly pick a door(a number between 0 and 2} function PickDoor(): Integer; begin Exit(Trunc(Random * 3)); end; var i: Integer; PrizeDoor: Integer; ChosenDoor: Integer; WinsChangingDoors: Integer = 0; WinsNotChangingDoors: Integer = 0;...

Give a code snippet in #Pascal Suppose you're on a game show and you're given the choice of three doors. Behind one door is a car; behind the others, goats. The car and the goats were placed randomly behind the doors before the show. Rules of the game After you have chosen a door, the door remains closed for th...

christopher/rosetta-code

http://rosettacode.org/wiki/Window_creation

Window creation

Display a GUI window. The window need not have any contents, but should respond to requests to be closed.

#Clojure

Clojure

(import '(javax.swing JFrame)) (let [frame (JFrame. "A Window")] (doto frame (.setSize 600 800) (.setVisible true)))

Give a code snippet in #Clojure Display a GUI window. The window need not have any contents, but should respond to requests to be closed.

christopher/rosetta-code

http://rosettacode.org/wiki/Singly-linked_list/Element_definition

Singly-linked list/Element definition

singly-linked list See also Array Associative array: Creation, Iteration Collections Compound data type Doubly-linked list: Definition, Element definition, Element insertion, List Traversal, Element Removal Linked list Queue: Definition, Usage Set Singly-linked list: Element definition, Element insertion, Lis...

#PicoLisp

PicoLisp

declare 1 node based (p), 2 value fixed, 2 link pointer;

Give a code snippet in #PicoLisp singly-linked list See also Array Associative array: Creation, Iteration Collections Compound data type Doubly-linked list: Definition, Element definition, Element insertion, List Traversal, Element Removal Linked list Queue: Definition, Usage Set Singly-linked list: Element ...

christopher/rosetta-code

http://rosettacode.org/wiki/Additive_primes

Additive primes

Definitions In mathematics, additive primes are prime numbers for which the sum of their decimal digits are also primes. Task Write a program to determine (and show here) all additive primes less than 500. Optionally, show the number of additive primes. Also see the OEIS entry: A046704 additive primes. ...

#Delphi

Delphi

proc sieve([*] bool prime) void: word max, p, c; max := dim(prime,1)-1; prime[0] := false; prime[1] := false; for p from 2 upto max do prime[p] := true od; for p from 2 upto max/2 do for c from p*2 by p upto max do prime[c] := false od od corp proc digit_sum(wor...

Give a code snippet in #Delphi Definitions In mathematics, additive primes are prime numbers for which the sum of their decimal digits are also primes. Task Write a program to determine (and show here) all additive primes less than 500. Optionally, show the number of additive primes. Also see the OEIS entry...

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...

#AutoHotkey

AutoHotkey

While mod(A_Index, 6) ;comment:everything but 0 is considered true output = %output%`n%A_Index% MsgBox % output

Give a code snippet in #AutoHotkey 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 Lo...

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...

#M2000_Interpreter

M2000 Interpreter

Module Ycombinator { \\ y() return value. no use of closure y=lambda (g, x)->g(g, x) Print y(lambda (g, n as decimal)->if(n=0->1, n*g(g, n-1)), 10)=3628800 ' true Print y(lambda (g, n)->if(n<=1->n,g(g, n-1)+g(g, n-2)), 10)=55 ' true \\ Using closure in y, y() return function y=lambda (g)->lambda g (x) -> g(g,...

Give a code snippet in #M2000_Interpreter 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 s...

christopher/rosetta-code

http://rosettacode.org/wiki/Peaceful_chess_queen_armies

Peaceful chess queen armies

In chess, a queen attacks positions from where it is, in straight lines up-down and left-right as well as on both its diagonals. It attacks only pieces not of its own colour. ⇖ ⇑ ⇗ ⇐ ⇐ ♛ ⇒ ⇒ ⇙ ⇓ ⇘ ⇙ ⇓ ⇘ ⇓ The goal of Peaceful chess queen armies is to arrange m black queens and m white queens ...

#Phix

Phix

-- -- demo\rosetta\Queen_Armies.exw -- ============================= -- with javascript_semantics requires("1.0.2") -- (puts(fn,x,false) for p2js.js) string html = "" constant as_html = true constant queens = {``, `♛`, `<font color="green">♕</font>`, `<span styl...

Give a code snippet in #Phix In chess, a queen attacks positions from where it is, in straight lines up-down and left-right as well as on both its diagonals. It attacks only pieces not of its own colour. ⇖ ⇑ ⇗ ⇐ ⇐ ♛ ⇒ ⇒ ⇙ ⇓ ⇘ ⇙ ⇓ ⇘ ⇓ The goal of Peaceful chess queen armies is to arrange m bl...

christopher/rosetta-code

http://rosettacode.org/wiki/Sum_and_product_of_an_array

Sum and product of an array

Task Compute the sum and product of an array of integers.

#Run_BASIC

Run BASIC

dim array(100) for i = 1 To 100 array(i) = rnd(0) * 100 next i product = 1 for i = 0 To 19 sum = (sum + array(i)) product = (product * array(i)) next i Print " Sum is ";sum Print "Product is ";product

Give a code snippet in #Run_BASIC Task Compute the sum and product of an array of integers.

christopher/rosetta-code

http://rosettacode.org/wiki/World_Cup_group_stage

World Cup group stage

It's World Cup season (or at least it was when this page was created)! The World Cup is an international football/soccer tournament that happens every 4 years. Countries put their international teams together in the years between tournaments and qualify for the tournament based on their performance in other internat...

#Elixir

Elixir

defmodule World_Cup do def group_stage do results = [[3,0],[1,1],[0,3]] teams = [0,1,2,3] allresults = combos(2,teams) |> combinations(results) allpoints = for list <- allresults, do: (for {l1,l2} <- list, do: Enum.zip(l1,l2)) |> List.flatten totalpoints = for list <- allpoints, do: (for t <- team...

Give a code snippet in #Elixir It's World Cup season (or at least it was when this page was created)! The World Cup is an international football/soccer tournament that happens every 4 years. Countries put their international teams together in the years between tournaments and qualify for the tournament based on the...

christopher/rosetta-code

http://rosettacode.org/wiki/Abbreviations,_easy

Abbreviations, easy

This task is an easier (to code) variant of the Rosetta Code task: Abbreviations, simple. For this task, the following command table will be used: Add ALTer BAckup Bottom CAppend Change SCHANGE CInsert CLAst COMPress COpy COUnt COVerlay CURsor DELete CDelete Down DUPlicate Xedit EXPand EXTract Find ...

#Prolog

Prolog

:- initialization(main). command_table("Add ALTer BAckup Bottom CAppend Change SCHANGE CInsert CLAst COMPress COpy COUnt COVerlay CURsor DELete CDelete Down DUPlicate Xedit EXPand EXTract Find NFind NFINDUp NFUp CFind FINdup FUp FOrward GET Help HEXType Input POWerinput Join SPlit SPLTJOIN LOAD Locate CLocate ...

Give a code snippet in #Prolog This task is an easier (to code) variant of the Rosetta Code task: Abbreviations, simple. For this task, the following command table will be used: Add ALTer BAckup Bottom CAppend Change SCHANGE CInsert CLAst COMPress COpy COUnt COVerlay CURsor DELete CDelete Down DUPl...

christopher/rosetta-code

http://rosettacode.org/wiki/Jump_anywhere

Jump anywhere

Imperative programs conditional structures loops local jumps This task is to demonstrate a local jump and a global jump and the various other types of jumps that the language supports. For the purpose of this task, the jumps need not be used for a single purpose and you have the freedom to use these jumps for different...

#Fortran

Fortran

' FB 1.05.0 Win64 ' compiled with -lang fb (the default) and -e switches Sub MySub() Goto localLabel Dim a As Integer = 10 '' compiler warning that this variable definition is being skipped localLabel: Print "localLabel reached" Print "a = "; a '' prints garbage as 'a' is uninitialized End Sub Sub MyS...

Give a code snippet in #Fortran Imperative programs conditional structures loops local jumps This task is to demonstrate a local jump and a global jump and the various other types of jumps that the language supports. For the purpose of this task, the jumps need not be used for a single purpose and you have the freedom...

christopher/rosetta-code

http://rosettacode.org/wiki/Environment_variables

Environment variables

Task Show how to get one of your process's environment variables. The available variables vary by system; some of the common ones available on Unix include: PATH HOME USER

#BASIC

BASIC

x$ = ENVIRON$("path") PRINT x$

Give a code snippet in #BASIC Task Show how to get one of your process's environment variables. The available variables vary by system; some of the common ones available on Unix include: PATH HOME USER

christopher/rosetta-code

http://rosettacode.org/wiki/Largest_int_from_concatenated_ints

Largest int from concatenated ints

Task Given a set of positive integers, write a function to order the integers in such a way that the concatenation of the numbers forms the largest possible integer and return this integer. Use the following two sets of integers as tests and show your program output here. {1, 34, 3, 98, 9, 76, 45, 4} {54,...

#C.23

C#

using System; using System.Collections.Generic; using System.Linq; class Program { static void Main(string[] args) { var source1 = new int[] { 1, 34, 3, 98, 9, 76, 45, 4 }; var source2 = new int[] { 54, 546, 548, 60 }; var largest1 = LargestPossibleSequence(source1); var larg...

Give a code snippet in #C.23 Task Given a set of positive integers, write a function to order the integers in such a way that the concatenation of the numbers forms the largest possible integer and return this integer. Use the following two sets of integers as tests and show your program output here. {1, 34...

christopher/rosetta-code

http://rosettacode.org/wiki/AVL_tree

AVL tree

This page uses content from Wikipedia. The original article was at AVL tree. 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) In computer science, an AVL tree is a self-balancing binary search tree....

#Ada

Ada

with Ada.Text_IO, Ada.Finalization, Ada.Unchecked_Deallocation; procedure Main is generic type Key_Type is private; with function "<"(a, b : Key_Type) return Boolean is <>; with function "="(a, b : Key_Type) return Boolean is <>; with function "<="(a, b : Key_Type) return Boolean is <>;...

Give a code snippet in #Ada This page uses content from Wikipedia. The original article was at AVL tree. 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) In computer science, an AVL tree is a self-...

christopher/rosetta-code

http://rosettacode.org/wiki/Strip_a_set_of_characters_from_a_string

Strip a set of characters from a string

Task Create a function that strips a set of characters from a string. The function should take two arguments: a string to be stripped a string containing the set of characters to be stripped The returned string should contain the first string, stripped of any characters in the second argument: print str...

#Seed7

Seed7

$ include "seed7_05.s7i"; const func string: stripchars (in string: mainStri, in string: charList) is func result var string: strippedStri is ""; local var char: ch is ' '; begin strippedStri := mainStri; for ch range charList do strippedStri := replace(strippedStri, str(ch), ""); end ...

Give a code snippet in #Seed7 Task Create a function that strips a set of characters from a string. The function should take two arguments: a string to be stripped a string containing the set of characters to be stripped The returned string should contain the first string, stripped of any characters in t...

christopher/rosetta-code

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

Loops/While

Task Start an integer value at 1024. Loop while it is greater than zero. Print the value (with a newline) and divide it by two each time through the loop. Related tasks Loop over multiple arrays simultaneously Loops/Break Loops/Continue Loops/Do-while Loops/Downward for Loops/For Loops/For...

#K

K

{while[x>0; \echo x; x%:2]} 1024

Give a code snippet in #K Task Start an integer value at 1024. Loop while it is greater than zero. Print the value (with a newline) and divide it by two each time through the loop. Related tasks Loop over multiple arrays simultaneously Loops/Break Loops/Continue Loops/Do-while Loops/Downward fo...

christopher/rosetta-code

http://rosettacode.org/wiki/Trigonometric_functions

Trigonometric functions

Task If your language has a library or built-in functions for trigonometry, show examples of: sine cosine tangent inverses (of the above) using the same angle in radians and degrees. For the non-inverse functions, each radian/degree pair should use arguments that evaluate to the same angle (that i...

#NetRexx

NetRexx

/* NetRexx */ options replace format comments java crossref symbols nobinary utf8 numeric digits 30 parse 'Radians Degrees angle' RADIANS DEGREES ANGLE .; parse 'sine cosine tangent arcsine arccosine arctangent' SINE COSINE TANGENT ARCSINE ARCCOSINE ARCTANGENT . trigVals = '' trigVals[RADIANS, ANGLE ] = (Rexx...

Give a code snippet in #NetRexx Task If your language has a library or built-in functions for trigonometry, show examples of: sine cosine tangent inverses (of the above) using the same angle in radians and degrees. For the non-inverse functions, each radian/degree pair should use arguments that eva...

christopher/rosetta-code

http://rosettacode.org/wiki/Shell_one-liner

Shell one-liner

Task Show how to specify and execute a short program in the language from a command shell, where the input to the command shell is only one line in length. Avoid depending on the particular shell or operating system used as much as is reasonable; if the language has notable implementations which have different comman...

#Burlesque

Burlesque

Burlesque.exe --no-stdin "5 5 .+"

Give a code snippet in #Burlesque Task Show how to specify and execute a short program in the language from a command shell, where the input to the command shell is only one line in length. Avoid depending on the particular shell or operating system used as much as is reasonable; if the language has notable implemen...

christopher/rosetta-code

http://rosettacode.org/wiki/Semiprime

Semiprime

Semiprime numbers are natural numbers that are products of exactly two (possibly equal) prime numbers. Semiprimes are also known as: semi-primes biprimes bi-primes 2-almost primes or simply: P2 Example 1679 = 23 × 73 (This particular number was chosen as the length of the Arecib...

#Wren

Wren

var semiprime = Fn.new { |n| if (n < 3) return false var nf = 0 for (i in 2..n) { while (n%i == 0) { if (nf == 2) return false nf = nf + 1 n = (n/i).floor } } return nf == 2 } for (v in 1675..1680) { System.print("%(v) -> %(semiprime.call(v) ...

Give a code snippet in #Wren Semiprime numbers are natural numbers that are products of exactly two (possibly equal) prime numbers. Semiprimes are also known as: semi-primes biprimes bi-primes 2-almost primes or simply: P2 Example 1679 = 23 × 73 (This particular number was chos...

christopher/rosetta-code

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

Bitmap/Write a PPM file

Using the data storage type defined on this page for raster images, write the image to a PPM file (binary P6 prefered). (Read the definition of PPM file on Wikipedia.)

#E

E

-module(ppm). -export([ppm/1, write/2]). -define(WHITESPACE, <<10>>). -define(SPACE, <<32>>). % data structure introduced in task Bitmap (module ros_bitmap.erl) -record(bitmap, { pixels = nil, shape = {0, 0} }). % create ppm image from bitmap record ppm(Bitmap) -> {Width, Height} = Bitmap#bitmap...

Give a code snippet in #E Using the data storage type defined on this page for raster images, write the image to a PPM file (binary P6 prefered). (Read the definition of PPM file on Wikipedia.)

christopher/rosetta-code

http://rosettacode.org/wiki/HTTP

HTTP

Task Access and print a URL's content (the located resource) to the console. There is a separate task for HTTPS Requests.

#Erlang

Erlang

-module(main). -export([main/1]). main([Url|[]]) -> inets:start(), case http:request(Url) of {ok, {_V, _H, Body}} -> io:fwrite("~p~n",[Body]); {error, Res} -> io:fwrite("~p~n", [Res]) end.

Give a code snippet in #Erlang Task Access and print a URL's content (the located resource) to the console. There is a separate task for HTTPS Requests.

christopher/rosetta-code

http://rosettacode.org/wiki/Bitmap

Bitmap

Show a basic storage type to handle a simple RGB raster graphics image, and some primitive associated functions. If possible provide a function to allocate an uninitialised image, given its width and height, and provide 3 additional functions: one to fill an image with a plain RGB color, one to set a given pixe...

#Applesoft_BASIC

Applesoft BASIC

100 W = 8 110 H = 8 120 BB = 24576 + LEN ( STR$ (W) + STR$ (H)) + 9: REM P6 HEADER 130 HIMEM: 8192 140 R = 255 150 G = 255 160 B = 0 170 C = R + G * 256 + B * 65536 180 GOSUB 600FILL 190 X = 4 200 Y = 5 210 R = 127 220 G = 127 230 B = 255 240 C = R + G * 256 + B * 65536 250 GOSUB 500"SET PIXEL" 2...

Give a code snippet in #Applesoft_BASIC Show a basic storage type to handle a simple RGB raster graphics image, and some primitive associated functions. If possible provide a function to allocate an uninitialised image, given its width and height, and provide 3 additional functions: one to fill an image with a pl...

christopher/rosetta-code

http://rosettacode.org/wiki/Repeat_a_string

Repeat a string

Take a string and repeat it some number of times. Example: repeat("ha", 5) => "hahahahaha" If there is a simpler/more efficient way to repeat a single “character” (i.e. creating a string filled with a certain character), you might want to show that as well (i.e. repeat-char("*", 5) => "*****"). Other tasks re...

#BaCon

BaCon

DOTIMES 5 s$ = s$ & "ha" DONE PRINT s$

Give a code snippet in #BaCon Take a string and repeat it some number of times. Example: repeat("ha", 5) => "hahahahaha" If there is a simpler/more efficient way to repeat a single “character” (i.e. creating a string filled with a certain character), you might want to show that as well (i.e. repeat-char("*", 5) ...

christopher/rosetta-code

http://rosettacode.org/wiki/Luhn_test_of_credit_card_numbers

Luhn test of credit card numbers

The Luhn test is used by some credit card companies to distinguish valid credit card numbers from what could be a random selection of digits. Those companies using credit card numbers that can be validated by the Luhn test have numbers that pass the following test: Reverse the order of the digits in the number. Tak...

#sed

sed

# Split number into double evens and odds s/.*/&: / : split s/$[0-4]$$[0-9]$:$.*$ /:\1\1\3 \2/ s/$[5-9]$$[0-9]$:$.*$ /:1\1\1\3 \2/ t split # Set up addition lookup table s/$[0-9]$*:$.*$ $.*$/\1\2\3:0123456789012345678/ : add s/$[0-9]$0:/\1:/ s/$[0-9]$1:$.*\1.\{0\}\([0-9]$.*\)/\3:\2/ s/\([0-9...

Give a code snippet in #sed The Luhn test is used by some credit card companies to distinguish valid credit card numbers from what could be a random selection of digits. Those companies using credit card numbers that can be validated by the Luhn test have numbers that pass the following test: Reverse the order of t...

christopher/rosetta-code

http://rosettacode.org/wiki/Floyd-Warshall_algorithm

Floyd-Warshall algorithm

The Floyd–Warshall algorithm is an algorithm for finding shortest paths in a weighted graph with positive or negative edge weights. Task Find the lengths of the shortest paths between all pairs of vertices of the given directed graph. Your code may assume that the input has already been checked for loops, parallel ...

#C.2B.2B

C++

#include <iostream> #include <vector> #include <sstream> void print(std::vector<std::vector<double>> dist, std::vector<std::vector<int>> next) { std::cout << "(pair, dist, path)" << std::endl; const auto size = std::size(next); for (auto i = 0; i < size; ++i) { for (auto j = 0; j < size; ++j) { if (i ...

Give a code snippet in #C.2B.2B The Floyd–Warshall algorithm is an algorithm for finding shortest paths in a weighted graph with positive or negative edge weights. Task Find the lengths of the shortest paths between all pairs of vertices of the given directed graph. Your code may assume that the input has already ...

christopher/rosetta-code

http://rosettacode.org/wiki/Show_ASCII_table

Show ASCII table

Task Show the ASCII character set from values 32 to 127 (decimal) in a table format. Other tasks related to string operations: Metrics Array length String length Copy a string Empty string (assignment) Counting Word frequency Letter frequency Jewels and stones I before E except after C Bioin...

#ALGOL_W

ALGOL W

begin % generate an ascii table for chars 32 - 127 % integer cPos; cPos := 0; for i := 32 until 127 do begin if cPos = 0 then write(); cPos := ( cPos + 1 ) rem 6; writeon( i_w := 3, s_w := 0, i, ": " ); if i = 32 then writeon( "Spc ") else if i = ...

Give a code snippet in #ALGOL_W Task Show the ASCII character set from values 32 to 127 (decimal) in a table format. Other tasks related to string operations: Metrics Array length String length Copy a string Empty string (assignment) Counting Word frequency Letter frequency Jewels and stones ...

christopher/rosetta-code

http://rosettacode.org/wiki/Infinity

Infinity

Task Write a function which tests if infinity is supported for floating point numbers (this step should be omitted for languages where the language specification already demands the existence of infinity, e.g. by demanding IEEE numbers), and if so, returns positive infinity. Otherwise, return the largest possible po...

#Oz

Oz

declare PosInf = 1./0. NegInf = ~1./0. in {Show PosInf} {Show NegInf} %% some assertion 42. / PosInf = 0. 42. / NegInf = 0. PosInf * PosInf = PosInf PosInf * NegInf = NegInf NegInf * NegInf = PosInf

Give a code snippet in #Oz Task Write a function which tests if infinity is supported for floating point numbers (this step should be omitted for languages where the language specification already demands the existence of infinity, e.g. by demanding IEEE numbers), and if so, returns positive infinity. Otherwise, re...

christopher/rosetta-code

http://rosettacode.org/wiki/Safe_addition

Safe addition

Implementation of interval arithmetic and more generally fuzzy number arithmetic require operations that yield safe upper and lower bounds of the exact result. For example, for an addition, it is the operations +↑ and +↓ defined as: a +↓ b ≤ a + b ≤ a +↑ b. Additionally it is desired that the widt...

#Mathematica.2FWolfram_Language

Mathematica/Wolfram Language

import fenv, strutils proc `++`(a, b: float): tuple[lower, upper: float] = let a {.volatile.} = a b {.volatile.} = b orig = fegetround() discard fesetround FE_DOWNWARD result.lower = a + b discard fesetround FE_UPWARD result.upper = a + b discard fesetround orig proc ff(a: float): string = a...

Give a code snippet in #Mathematica.2FWolfram_Language Implementation of interval arithmetic and more generally fuzzy number arithmetic require operations that yield safe upper and lower bounds of the exact result. For example, for an addition, it is the operations +↑ and +↓ defined as: a +↓ b ≤ a ...

christopher/rosetta-code

http://rosettacode.org/wiki/User_input/Graphical

User input/Graphical

In this task, the goal is to input a string and the integer 75000, from graphical user interface. See also: User input/Text

#Delphi

Delphi

program UserInputGraphical; {$APPTYPE CONSOLE} uses SysUtils, Dialogs; var s: string; lStringValue: string; lIntegerValue: Integer; begin lStringValue := InputBox('User input/Graphical', 'Enter a string', ''); repeat s := InputBox('User input/Graphical', 'Enter the number 75000', '75000'); lIn...

Give a code snippet in #Delphi In this task, the goal is to input a string and the integer 75000, from graphical user interface. See also: User input/Text

christopher/rosetta-code

http://rosettacode.org/wiki/Roots_of_a_quadratic_function

Roots of a quadratic function

This task has been clarified. Its programming examples are in need of review to ensure that they still fit the requirements of the task. Write a program to find the roots of a quadratic equation, i.e., solve the equation a x 2 + b x + c = 0 {\displaystyle ax^{2}+bx+c=0} . Your program must correctly handle n...

#Go

Go

package main import ( "fmt" "math" ) func qr(a, b, c float64) ([]float64, []complex128) { d := b*b-4*a*c switch { case d == 0: // single root return []float64{-b/(2*a)}, nil case d > 0: // two real roots if b < 0 { d = math.Sqrt(d)-b } else...

Give a code snippet in #Go This task has been clarified. Its programming examples are in need of review to ensure that they still fit the requirements of the task. Write a program to find the roots of a quadratic equation, i.e., solve the equation a x 2 + b x + c = 0 {\displaystyle ax^{2}+bx+c=0} . Your pro...

christopher/rosetta-code

http://rosettacode.org/wiki/Character_codes

Character codes

Task Given a character value in your language, print its code (could be ASCII code, Unicode code, or whatever your language uses). Example The character 'a' (lowercase letter A) has a code of 97 in ASCII (as well as Unicode, as ASCII forms the beginning of Unicode). Conversely, given a code, print out...

#Sidef

Sidef

say 'a'.ord; # => 97 say 97.chr; # => 'a'

Give a code snippet in #Sidef Task Given a character value in your language, print its code (could be ASCII code, Unicode code, or whatever your language uses). Example The character 'a' (lowercase letter A) has a code of 97 in ASCII (as well as Unicode, as ASCII forms the beginning of Unicode). Conv...

christopher/rosetta-code

http://rosettacode.org/wiki/Inverted_syntax

Inverted syntax

Inverted syntax with conditional expressions In traditional syntax conditional expressions are usually shown before the action within a statement or code block: IF raining=true THEN needumbrella=true In inverted syntax, the action is listed before the conditional expression in the statement or code block: needumb...

#Z80_Assembly

Z80 Assembly

byte &EF,&BE word &BEEF

Give a code snippet in #Z80_Assembly Inverted syntax with conditional expressions In traditional syntax conditional expressions are usually shown before the action within a statement or code block: IF raining=true THEN needumbrella=true In inverted syntax, the action is listed before the conditional expression in ...

christopher/rosetta-code

http://rosettacode.org/wiki/Topological_sort

Topological sort

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 ...

#Python

Python

try: from functools import reduce except: pass data = { 'des_system_lib': set('std synopsys std_cell_lib des_system_lib dw02 dw01 ramlib ieee'.split()), 'dw01': set('ieee dw01 dware gtech'.split()), 'dw02': set('ieee dw02 dware'.split()), 'dw03': set('std ...

Give a code snippet in #Python 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 s...

christopher/rosetta-code

http://rosettacode.org/wiki/Doubly-linked_list/Traversal

Doubly-linked list/Traversal

Traverse from the beginning of a doubly-linked list to the end, and from the end to the beginning. See also Array Associative array: Creation, Iteration Collections Compound data type Doubly-linked list: Definition, Element definition, Element insertion, List Traversal, Element Removal Linked list Queue: Def...

#ALGOL_68

ALGOL 68

# Node struct - contains next and prev NODE pointers and DATA # MODE NODE = STRUCT( DATA data, REF NODE prev, REF NODE next ); # List structure - contains head and tail NODE pointers # MODE LIST = STRUCT( REF NODE head, REF NODE tail ); # --- PREPEND - Adds a node to the beginni...

Give a code snippet in #ALGOL_68 Traverse from the beginning of a doubly-linked list to the end, and from the end to the beginning. See also Array Associative array: Creation, Iteration Collections Compound data type Doubly-linked list: Definition, Element definition, Element insertion, List Traversal, Elemen...

christopher/rosetta-code

http://rosettacode.org/wiki/Compare_a_list_of_strings

Compare a list of strings

Task Given a list of arbitrarily many strings, show how to: test if they are all lexically equal test if every string is lexically less than the one after it (i.e. whether the list is in strict ascending order) Each of those two tests should result in a single true or false value, which could be used as t...

#SenseTalk

SenseTalk

analyze ["AA","BB","CC"] analyze ["AA","AA","AA"] analyze ["AA","CC","BB"] analyze ["AA","ACB","BB","CC"] analyze ["single_element"] to analyze aList put "List: " & aList put " " & (if allEqual(aList) then "IS" else "Is NOT") && "all equal" put " " & (if isAscending(aList) then "IS" else "Is NOT") && "strictly...

Give a code snippet in #SenseTalk Task Given a list of arbitrarily many strings, show how to: test if they are all lexically equal test if every string is lexically less than the one after it (i.e. whether the list is in strict ascending order) Each of those two tests should result in a single true or fa...

christopher/rosetta-code

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

Averages/Mode

Task[edit] Write a program to find the mode value of a collection. The case where the collection is empty may be ignored. Care must be taken to handle the case where the mode is non-unique. If it is not appropriate or possible to support a general collection, use a vector (array), if possible. If it is not appropriat...

#Rust

Rust

use std::collections::HashMap; fn main() { let mode_vec1 = mode(vec![ 1, 3, 6, 6, 6, 6, 7, 7, 12, 12, 17]); let mode_vec2 = mode(vec![ 1, 1, 2, 4, 4]); println!("Mode of vec1 is: {:?}", mode_vec1); println!("Mode of vec2 is: {:?}", mode_vec2); assert!( mode_vec1 == [6], "Error in mode calculat...

Give a code snippet in #Rust Task[edit] Write a program to find the mode value of a collection. The case where the collection is empty may be ignored. Care must be taken to handle the case where the mode is non-unique. If it is not appropriate or possible to support a general collection, use a vector (array), if pos...

christopher/rosetta-code

http://rosettacode.org/wiki/Esthetic_numbers

Esthetic numbers

An esthetic number is a positive integer where every adjacent digit differs from its neighbour by 1. E.G. 12 is an esthetic number. One and two differ by 1. 5654 is an esthetic number. Each digit is exactly 1 away from its neighbour. 890 is not an esthetic number. Nine and zero differ by 9. These examples are n...

#Pascal

Pascal

program Esthetic; {$IFDEF FPC} {$MODE DELPHI} {$OPTIMIZATION ON,ALL} {$codealign proc=16} {$ELSE} {$APPTYPE CONSOLE} {$ENDIF} uses sysutils,//IntToStr strutils;//Numb2USA aka commatize const ConvBase :array[0..15] of char= '0123456789ABCDEF'; maxBase = 16; type tErg = string[63]; tCnt = array[0..maxBas...

Give a code snippet in #Pascal An esthetic number is a positive integer where every adjacent digit differs from its neighbour by 1. E.G. 12 is an esthetic number. One and two differ by 1. 5654 is an esthetic number. Each digit is exactly 1 away from its neighbour. 890 is not an esthetic number. Nine and zero dif...

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...

#Clojure

Clojure

(defn paragraph [num] (str num " bottles of beer on the wall\n" num " bottles of beer\n" "Take one down, pass it around\n" (dec num) " bottles of beer on the wall.\n")) (defn lyrics [] (let [numbers (range 99 0 -1) paragraphs (map paragraph numbers)] (clojure.string/join "\n" pa...

Give a code snippet in #Clojure 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 ...

christopher/rosetta-code

http://rosettacode.org/wiki/Multiple_regression

Multiple regression

Task Given a set of data vectors in the following format: y = { y 1 , y 2 , . . . , ...

#Ursala

Ursala

regression_coefficients = lapack..dgelsd

Give a code snippet in #Ursala Task Given a set of data vectors in the following format: y = { y 1 , y 2 , . . ...

christopher/rosetta-code

http://rosettacode.org/wiki/Sum_of_squares

Sum of squares

Task Write a program to find the sum of squares of a numeric vector. The program should work on a zero-length vector (with an answer of 0). Related task Mean

#Python

Python

sum(x * x for x in [1, 2, 3, 4, 5]) # or sum(x ** 2 for x in [1, 2, 3, 4, 5]) # or sum(pow(x, 2) for x in [1, 2, 3, 4, 5])

Give a code snippet in #Python Task Write a program to find the sum of squares of a numeric vector. The program should work on a zero-length vector (with an answer of 0). Related task Mean

christopher/rosetta-code

http://rosettacode.org/wiki/Factors_of_an_integer

Factors of an integer

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 |...

#OCaml

OCaml

let rec range = function 0 -> [] | n -> range(n-1) @ [n] let factors n = List.filter (fun v -> (n mod v) = 0) (range n)

Give a code snippet in #OCaml 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 ...

christopher/rosetta-code

http://rosettacode.org/wiki/Fibonacci_word

Fibonacci word

The Fibonacci Word may be created in a manner analogous to the Fibonacci Sequence as described here: Define F_Word1 as 1 Define F_Word2 as 0 Form F_Word3 as F_Word2 concatenated with F_Word1 i.e.: 01 Form F_Wordn as F_Wordn-1 concatenated with F_wordn-...

#Seed7

Seed7

$ include "seed7_05.s7i"; include "float.s7i"; include "math.s7i"; const func float: entropy (in string: stri) is func result var float: entropy is 0.0; local var hash [char] integer: count is (hash [char] integer).value; var char: ch is ' '; var float: p is 0.0; begin for ch range stri ...

Give a code snippet in #Seed7 The Fibonacci Word may be created in a manner analogous to the Fibonacci Sequence as described here: Define F_Word1 as 1 Define F_Word2 as 0 Form F_Word3 as F_Word2 concatenated with F_Word1 i.e.: 01 Form F_Wordn as F_Wordn-1...

christopher/rosetta-code

http://rosettacode.org/wiki/Luhn_test_of_credit_card_numbers

Luhn test of credit card numbers

The Luhn test is used by some credit card companies to distinguish valid credit card numbers from what could be a random selection of digits. Those companies using credit card numbers that can be validated by the Luhn test have numbers that pass the following test: Reverse the order of the digits in the number. Tak...

#ZX_Spectrum_Basic

ZX Spectrum Basic

10 LET c$="49927398716": GO SUB 1000 20 LET c$="49927398717": GO SUB 1000 30 LET c$="1234567812345678": GO SUB 1000 40 LET c$="1234567812345670": GO SUB 1000 999 STOP 1000 REM ************* 1001 REM * LUHN TEST * 1002 REM ************* 1010 LET r$="" 1020 FOR i=LEN c$ TO 1 STEP -1 1030 LET r$=r$+c$(i) 1040 NEXT i 1050...

Give a code snippet in #ZX_Spectrum_Basic The Luhn test is used by some credit card companies to distinguish valid credit card numbers from what could be a random selection of digits. Those companies using credit card numbers that can be validated by the Luhn test have numbers that pass the following test: Reverse ...

christopher/rosetta-code

http://rosettacode.org/wiki/Add_a_variable_to_a_class_instance_at_runtime

Add a variable to a class instance at runtime

Demonstrate how to dynamically add variables to an object (a class instance) at runtime. This is useful when the methods/variables of an instance are based on a data file that isn't available until runtime. Hal Fulton gives an example of creating an OO CSV parser at An Exercise in Metaprogramming with Ruby. This is re...

#Ruby

Ruby

class Empty end e = Empty.new class << e attr_accessor :foo end e.foo = 1 puts e.foo # output: "1" f = Empty.new f.foo = 1 # raises NoMethodError

Give a code snippet in #Ruby Demonstrate how to dynamically add variables to an object (a class instance) at runtime. This is useful when the methods/variables of an instance are based on a data file that isn't available until runtime. Hal Fulton gives an example of creating an OO CSV parser at An Exercise in Metapro...

christopher/rosetta-code

http://rosettacode.org/wiki/Hostname

Hostname

Task Find the name of the host on which the routine is running.

#Emacs_Lisp

Emacs Lisp

(system-name)

Give a code snippet in #Emacs_Lisp Task Find the name of the host on which the routine is running.

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 ...

#Computer.2Fzero_Assembly

Computer/zero Assembly

loop: LDA y ; higher No. STA temp ADD x ; lower No. STA y LDA temp STA x LDA count SUB one BRZ done STA count JMP loop done: LDA y STP one: 1 count: 8 ; n = 10 x: 1 y: ...

Give a code snippet in #Computer.2Fzero_Assembly 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 recu...

christopher/rosetta-code

http://rosettacode.org/wiki/Reverse_a_string

Reverse a string

Task Take a string and reverse it. For example, "asdf" becomes "fdsa". Extra credit Preserve Unicode combining characters. For example, "as⃝df̅" becomes "f̅ds⃝a", not "̅fd⃝sa". Other tasks related to string operations: Metrics Array length String length Copy a string Empty string (assignment) Counting ...

#8th

8th

"abc" s:rev

Give a code snippet in #8th Task Take a string and reverse it. For example, "asdf" becomes "fdsa". Extra credit Preserve Unicode combining characters. For example, "as⃝df̅" becomes "f̅ds⃝a", not "̅fd⃝sa". Other tasks related to string operations: Metrics Array length String length Copy a string Empty s...

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...

#NS-HUBASIC

NS-HUBASIC

10 PRINT "NO,"A" ISN'T A MULTIPLE OF 6." 20 A=A+1 30 IF A-(A/6)*6<>0 THEN GOTO 10 40 PRINT "YES, 6 IS A MULTIPLE OF 6."

Give a code snippet in #NS-HUBASIC 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 Lo...

christopher/rosetta-code

http://rosettacode.org/wiki/Roots_of_a_function

Roots of a function

Task Create a program that finds and outputs the roots of a given function, range and (if applicable) step width. The program should identify whether the root is exact or approximate. For this task, use: ƒ(x) = x3 - 3x2 + 2x

#PL.2FI

PL/I

f: procedure (x) returns (float (18)); declare x float (18); return (x**3 - 3*x**2 + 2*x ); end f; declare eps float, (x, y) float (18); declare dx fixed decimal (15,13); eps = 1e-12; do dx = -5.03 to 5 by 0.1; x = dx; if sign(f(x)) ^= sign(f(dx+0.1)) then call locate_root; end; locate_root:...

Give a code snippet in #PL.2FI Task Create a program that finds and outputs the roots of a given function, range and (if applicable) step width. The program should identify whether the root is exact or approximate. For this task, use: ƒ(x) = x3 - 3x2 + 2x

christopher/rosetta-code

http://rosettacode.org/wiki/Singly-linked_list/Element_definition

Singly-linked list/Element definition

singly-linked list See also Array Associative array: Creation, Iteration Collections Compound data type Doubly-linked list: Definition, Element definition, Element insertion, List Traversal, Element Removal Linked list Queue: Definition, Usage Set Singly-linked list: Element definition, Element insertion, Lis...

#Clojure

Clojure

(cons 1 (cons 2 (cons 3 nil))) ; =>(1 2 3)

Give a code snippet in #Clojure singly-linked list See also Array Associative array: Creation, Iteration Collections Compound data type Doubly-linked list: Definition, Element definition, Element insertion, List Traversal, Element Removal Linked list Queue: Definition, Usage Set Singly-linked list: Element d...

christopher/rosetta-code

http://rosettacode.org/wiki/Heronian_triangles

Heronian triangles

Hero's formula for the area of a triangle given the length of its three sides a, b, and c is given by: A = s ( s − a ) ( s − b ) ( s − c ) , {\displaystyle A={\sqrt {s(s-a)(s-b)(s-c)}},} where s is half the perimeter of the triangle; that is, s = a + b + c 2 . {\displaystyle s...

#D

D

import std.stdio, std.math, std.range, std.algorithm, std.numeric, std.traits, std.typecons; double hero(in uint a, in uint b, in uint c) pure nothrow @safe @nogc { immutable s = (a + b + c) / 2.0; immutable a2 = s * (s - a) * (s - b) * (s - c); return (a2 > 0) ? a2.sqrt : 0.0; } bool isHeronian(in uint...

Give a code snippet in #D Hero's formula for the area of a triangle given the length of its three sides a, b, and c is given by: A = s ( s − a ) ( s − b ) ( s − c ) , {\displaystyle A={\sqrt {s(s-a)(s-b)(s-c)}},} where s is half the perimeter of the triangle; that is, s = a + b + ...

christopher/rosetta-code

http://rosettacode.org/wiki/Prime_conspiracy

Prime conspiracy

A recent discovery, quoted from Quantamagazine (March 13, 2016): Two mathematicians have uncovered a simple, previously unnoticed property of prime numbers — those numbers that are divisible only by 1 and themselves. Prime numbers, it seems, have decided preferences about the final digits of ...

#REXX

REXX

/*REXX pgm shows a table of what last digit follows the previous last digit for N primes*/ parse arg N . /*N: the number of primes to be genned*/ if N=='' | N=="," then N= 1000000 /*Not specified? Then use the default.*/ Np= N+1; w= length(N-1) ...

Give a code snippet in #REXX A recent discovery, quoted from Quantamagazine (March 13, 2016): Two mathematicians have uncovered a simple, previously unnoticed property of prime numbers — those numbers that are divisible only by 1 and themselves. Prime numbers, it seems, have decided preferenc...

christopher/rosetta-code

http://rosettacode.org/wiki/Phrase_reversals

Phrase reversals

Task Given a string of space separated words containing the following phrase: rosetta code phrase reversal Reverse the characters of the string. Reverse the characters of each individual word in the string, maintaining original word order within the string. Reverse the order of each word of the string, maintaini...

#Raku

Raku

my $s = 'rosetta code phrase reversal'; put 'Input : ', $s; put 'String reversed : ', $s.flip; put 'Each word reversed : ', $s.words».flip; put 'Word-order reversed : ', $s.words.reverse;

Give a code snippet in #Raku Task Given a string of space separated words containing the following phrase: rosetta code phrase reversal Reverse the characters of the string. Reverse the characters of each individual word in the string, maintaining original word order within the string. Reverse the order of each...

christopher/rosetta-code

http://rosettacode.org/wiki/Caesar_cipher

Caesar cipher

Task Implement a Caesar cipher, both encoding and decoding. The key is an integer from 1 to 25. This cipher rotates (either towards left or right) the letters of the alphabet (A to Z). The encoding replaces each letter with the 1st to 25th next letter in the alphabet (wrapping Z to A). So key 2 encrypts "HI" to...

#Stata

Stata

function caesar(s, k) { u = ascii(s) i = selectindex(u:>=65 :& u:<=90) if (length(i)>0) u[i] = mod(u[i]:+(k-65), 26):+65 i = selectindex(u:>=97 :& u:<=122) if (length(i)>0) u[i] = mod(u[i]:+(k-97), 26):+97 return(char(u)) } caesar("layout", 20) fusion

Give a code snippet in #Stata Task Implement a Caesar cipher, both encoding and decoding. The key is an integer from 1 to 25. This cipher rotates (either towards left or right) the letters of the alphabet (A to Z). The encoding replaces each letter with the 1st to 25th next letter in the alphabet (wrapping Z to...

christopher/rosetta-code

http://rosettacode.org/wiki/15_puzzle_game

15 puzzle game

Task Implement the Fifteen Puzzle Game. The 15-puzzle is also known as: Fifteen Puzzle Gem Puzzle Boss Puzzle Game of Fifteen Mystic Square 14-15 Puzzle and some others. Related Tasks 15 Puzzle Solver 16 Puzzle Game

#Picat

Picat

import util. main => Board = {{1,2,3,4}, {5,6,7,8}, {9,10,11,12}, {13,14,15,0}}, Goal = copy_term(Board), shuffle(Board), play(Board,Goal). shuffle(Board) => foreach (_ in 1..1000) R1 = random() mod 4 + 1, C1 = random() mod 4 + 1, ...

Give a code snippet in #Picat Task Implement the Fifteen Puzzle Game. The 15-puzzle is also known as: Fifteen Puzzle Gem Puzzle Boss Puzzle Game of Fifteen Mystic Square 14-15 Puzzle and some others. Related Tasks 15 Puzzle Solver 16 Puzzle Game

christopher/rosetta-code

http://rosettacode.org/wiki/Sum_to_100

Sum to 100

Task Find solutions to the sum to one hundred puzzle. Add (insert) the mathematical operators + or - (plus or minus) before any of the digits in the decimal numeric string 123456789 such that the resulting mathematical expression adds up to a particular sum (in this iconic case, ...

#Perl

Perl

#!/usr/bin/perl use warnings; use strict; use feature qw{ say }; my $string = '123456789'; my $length = length $string; my @possible_ops = ("" , '+', '-'); { my @ops; sub Next { return @ops = (0) x ($length) unless @ops; my $i = 0; while ($i < $length) { if ($ops[$i]++ ...

Give a code snippet in #Perl Task Find solutions to the sum to one hundred puzzle. Add (insert) the mathematical operators + or - (plus or minus) before any of the digits in the decimal numeric string 123456789 such that the resulting mathematical expression adds up to a particular ...

christopher/rosetta-code

http://rosettacode.org/wiki/Mayan_numerals

Mayan numerals

Task Present numbers using the Mayan numbering system (displaying the Mayan numerals in a cartouche). Mayan numbers Normally, Mayan numbers are written vertically (top─to─bottom) with the most significant numeral at the top (in the sense that decimal numbers are written left─to─right with the most signific...

#BASIC

BASIC

10 DEFINT A-Z: DIM L$(5) 15 FOR I=0 TO 5: READ L$(I): NEXT I 20 LINE INPUT I$ 30 M=LEN(I$): DIM D(M) 40 FOR I=1 TO M: D(I)=VAL(MID$(I$,I,1)): NEXT I 50 FOR J=M-1 TO 1 STEP -1 60 FOR I=1 TO J 70 D(I+1) = D(I+1) + 10*(D(I) AND 1) 80 D(I) = D(I)\2 90 NEXT I,J 100 S=1 110 IF D(S)=0 AND S<M THEN S=S+1: GOTO 110 120 FOR I=S ...

Give a code snippet in #BASIC Task Present numbers using the Mayan numbering system (displaying the Mayan numerals in a cartouche). Mayan numbers Normally, Mayan numbers are written vertically (top─to─bottom) with the most significant numeral at the top (in the sense that decimal numbers are written left─...

christopher/rosetta-code

http://rosettacode.org/wiki/Variable_size/Set

Variable size/Set

Task Demonstrate how to specify the minimum size of a variable or a data type.

#C.2B.2B

C++

#include <boost/cstdint.hpp> boost::int_least32_t foo;

Give a code snippet in #C.2B.2B Task Demonstrate how to specify the minimum size of a variable or a data type.

christopher/rosetta-code

http://rosettacode.org/wiki/Perfect_numbers

Perfect numbers

Write a function which says whether a number is perfect. A perfect number is a positive integer that is the sum of its proper positive divisors excluding the number itself. Equivalently, a perfect number is a number that is half the sum of all of its positive divisors (including itself). Note: The faster Luca...

#PureBasic

PureBasic

Procedure is_Perfect_number(n) Protected summa, i=1, result=#False Repeat If Not n%i summa+i EndIf i+1 Until i>=n If summa=n result=#True EndIf ProcedureReturn result EndProcedure

Give a code snippet in #PureBasic Write a function which says whether a number is perfect. A perfect number is a positive integer that is the sum of its proper positive divisors excluding the number itself. Equivalently, a perfect number is a number that is half the sum of all of its positive divisors (including it...

christopher/rosetta-code

http://rosettacode.org/wiki/Best_shuffle

Best shuffle

Task Shuffle the characters of a string in such a way that as many of the character values are in a different position as possible. A shuffle that produces a randomized result among the best choices is to be preferred. A deterministic approach that produces the same sequence every time is acceptable as an alternative...

#Bracmat

Bracmat

( shuffle = m car cdr todo a z count string . !arg:(@(?:%?car ?cdr).?todo) & !Count:?count & ( @( !todo : ?a (%@:~!car:?m) ( ?z & shuffle$(!cdr.str$(!a !z)) : (<!count:...

Give a code snippet in #Bracmat Task Shuffle the characters of a string in such a way that as many of the character values are in a different position as possible. A shuffle that produces a randomized result among the best choices is to be preferred. A deterministic approach that produces the same sequence every tim...

christopher/rosetta-code

http://rosettacode.org/wiki/String_append

String append

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 |...

#EasyLang

EasyLang

a$ = "hello" a$ &= " world" print a$

Give a code snippet in #EasyLang 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 Operatio...

christopher/rosetta-code

http://rosettacode.org/wiki/Kernighans_large_earthquake_problem

Kernighans large earthquake problem

Brian Kernighan, in a lecture at the University of Nottingham, described a problem on which this task is based. Problem You are given a a data file of thousands of lines; each of three `whitespace` separated fields: a date, a one word name and the magnitude of the event. Example lines from the file would be lines li...

#Bash

Bash

#!/bin/bash while read line do [[ ${line##* } =~ ^([7-9]|6\.0*[1-9]).*$ ]] && echo "$line" done < data.txt

Give a code snippet in #Bash Brian Kernighan, in a lecture at the University of Nottingham, described a problem on which this task is based. Problem You are given a a data file of thousands of lines; each of three `whitespace` separated fields: a date, a one word name and the magnitude of the event. Example lines f...

christopher/rosetta-code