How to resolve the algorithm Sorting algorithms/Sleep sort step by step in the Nim programming language
Published on 12 May 2024 09:40 PM
How to resolve the algorithm Sorting algorithms/Sleep sort step by step in the Nim programming language
Table of Contents
Problem Statement
In general, sleep sort works by starting a separate task for each item to be sorted, where each task sleeps for an interval corresponding to the item's sort key, then emits the item. Items are then collected sequentially in time. Task: Write a program that implements sleep sort. Have it accept non-negative integers on the command line and print the integers in sorted order. If this is not idomatic in your language or environment, input and output may be done differently. Enhancements for optimization, generalization, practicality, robustness, and so on are not required. Sleep sort was presented anonymously on 4chan and has been discussed on Hacker News.
Let's start with the solution:
Step by Step solution about How to resolve the algorithm Sorting algorithms/Sleep sort step by step in the Nim programming language
Source code in the nim programming language
import os, strutils
proc single(n: int) =
sleep n
echo n
proc main =
var thr = newSeq[TThread[int]](paramCount())
for i,c in commandLineParams():
thr[i].createThread(single, c.parseInt)
thr.joinThreads
main()
You may also check:How to resolve the algorithm Create a two-dimensional array at runtime step by step in the REXX programming language
You may also check:How to resolve the algorithm Sum of a series step by step in the PostScript programming language
You may also check:How to resolve the algorithm Ultra useful primes step by step in the Julia programming language
You may also check:How to resolve the algorithm GUI enabling/disabling of controls step by step in the Kotlin programming language
You may also check:How to resolve the algorithm Sieve of Eratosthenes step by step in the Lambdatalk programming language