はてなブックマーク

Click on a programming task, and you can see solutions to that task in a variety of programming languages. If you want to see an unsorted list of all tasks on Rosetta Code, see Programming Tasks. If you have an idea for a programming task not listed here, you may request it or add it yourself. Subcategories This category has the following 62 subcategories, out of 62 total.

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 Bioinformatics/base count Count occurrences of a substring Count how many vowels and consonants occur in a string Remove/replace XXXX redacted Conjugate a Latin verb Remove vowels from a string String interpolation (included) Strip block c

Averages/Simple moving average You are encouraged to solve this task according to the task description, using any language you may know. Computing the simple moving average of a series of numbers. Task Create a stateful function/class/instance that takes a period and returns a routine that takes a number as argument and returns a simple moving average of its arguments so far. A simple moving avera

Hello world/Web server You are encouraged to solve this task according to the task description, using any language you may know. The browser is the new GUI ! Task Serve our standard text   Goodbye, World!   to   http://localhost:8080/   so that it can be viewed with a web browser. The provided solution must start or implement a server that accepts multiple client connections and serves text as req

Flatten a list You are encouraged to solve this task according to the task description, using any language you may know. Task Write a function to flatten the nesting in an arbitrary list of values. Your program should work on the equivalent of this list: [[1], 2, [[3, 4], 5], [[[]]], [[[6]]], 7, 8, []] Where the correct result would be the list: [1, 2, 3, 4, 5, 6, 7, 8] Related task Tree traversal

Stable marriage problem You are encouraged to solve this task according to the task description, using any language you may know. Solve the Stable marriage problem using the Gale/Shapley algorithm. Problem description Given an equal number of men and women to be paired for marriage, each man ranks all the women in order of his preference and each woman ranks all the men in order of her preference.

Portability notes The original Bourne shell went through a number of revisions in the early years of UNIX, and support for some features varies considerably. By the time the SUSv3 (Single Unix Specification, version 3) features stabilized, all versions of the various Bourne-compatible shells should support a common set of features. This is denoted in Rosette Code examples with the phrase: "SUSv3"

Though most modern languages have sorting functionality built in, programmers sometimes find it necessary to write their own sorts. Usually this is just an instructional activity. Below are some sorting algorithms that have been implemented on Rosetta Code. Pages in category "Sorting Algorithms" The following 47 pages are in this category, out of 47 total.

Combinations You are encouraged to solve this task according to the task description, using any language you may know. Task Given non-negative integers   m   and   n,   generate all size   m   combinations   of the integers from   0   (zero)   to   n-1   in sorted order   (each combination is sorted and the entire table is sorted). Example 3   comb   5     is: 0 1 2 0 1 3 0 1 4 0 2 3 0 2 4 0 3 4 1

Y combinator You are encouraged to solve this task according to the task description, using any language you may know. 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

Rosetta Code is a programming chrestomathy site. The idea is to present solutions to the same task in as many different languages as possible, to demonstrate how languages are similar and different, and to aid a person with a grounding in one approach to a problem in learning another. Rosetta Code currently has 1,310 tasks, 380 draft tasks, and is aware of 966 languages, though we do not (and cann

Welcome to Rosetta Code! This Main Page was created automatically and it seems it hasn't been replaced yet. For the bureaucrat(s) of this wiki Hello, and welcome to your new wiki! Thank you for choosing Miraheze for the hosting of your wiki, we hope you will enjoy our hosting. You can immediately start working on your wiki or whenever you want. Need help? No problem! We will help you with your wik