Square root by hand: Difference between revisions

{{draft task}}

 

 

=={{header|C#|CSharp}}==

{{Trans|Visual Basic .NET}}

{{libheader|System.Numerics}}

using static System.Math;

using static System.Console;

if (n0 > 0) WriteLine("\nTime taken for {0} digits: {1}", n0, DateTime.Now - st); }

 

Time taken for 500 digits: 00:00:00.0092331

</pre>

=={{header|D}}==

{{trans|C#}}

import std.math;

import std.stdio;

}

} while (n > 0);

{{out}}

<pre>14142135623730950488016887242096980785696718753769480731766797379907324784621070388503875343276415727350138462309122970249248360558507372126441214970999358314132226659275055927557999505011527820605714701095599716059702745345968620147285174186408891986095523292304843087143214508397626036279952514079896872533965463318088296406206152583523950547457502877599617298355752203375318570113543746034084988471603868999706990048150305440277903164542478230684929369186215805784631115966687130130156185689872372</pre>

 

=={{header|F_Sharp|F#}}==

// Square Root of n 'By Hand' (n as bigint >= 1). Nigel Galloway: October 14th., 2020

let rec fN n g=match n/100I with i when i=0I->(n%100I)::g |i->fN i ((n%100I)::g)

 

sR 2I 1 480; sR 1089I 2 8

{{out}}

<pre>

{{trans|Visual Basic .NET}}

The original has been adjusted in a similar fashion to the Wren entry to deal with non-integer cases.

 

import (

fmt.Println()

}

 

{{out}}

0.01

</pre>

 

=={{header|Java}}==

{{trans|D}}

 

public class SquareRoot {

System.out.println();

}

{{out}}

<pre>14142135623730950488016887242096980785696718753769480731766797379907324784621070388503875343276415727350138462309122970249248360558507372126441214970999358314132226659275055927557999505011527820605714701095599716059702745345968620147285174186408891986095523292304843087143214508397626036279952514079896872533965463318088296406206152583523950547457502877599617298355752203375318570113543746034084988471603868999706990048150305440277903164542478230684929369186215805784631115966687130130156185689872372</pre>

 

=={{header|Julia}}==

Uses channels to iterate the spigot flow.

spigot = Channel{Char}(bufsize)

 

 

testspigotsqrt([2, 0.2, 0, 00.0001, 10.89, 144e-6, 2.0e4, 0.00000009, 1.44e+04, 1.44e-32])

<pre>

The square root of 2.0 is:

00000000000000000000000000000000000000000000000000

</pre>

 

=={{header|Phix}}==

Based on https://en.wikipedia.org/wiki/Methods_of_computing_square_roots#Decimal_(base_10)<br>

The use of string inputs helps guarantee perfect accuracy.

{{out}}

<small>(the final "2" was re-joined up by hand)</small>

</pre>

stress test?:

{{out}}

<pre>

3.1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170680

</pre>

 

=={{header|Raku}}==

Implemented a [https://www.wikihow.com/Calculate-a-Square-Root-by-Hand#Finding-Square-Roots-Manually long division algorithm.].

 

sub integral (Str $in) { # prepend '0' if length is odd

say "The square root of $_ is";

SpigotSqrt $_ ; print "\n";

{{out}}

<pre>The square root of 25 is

 

It also handles the placing of a decimal point &nbsp; (if needed).

signal on halt /*handle the case of user interrupt. */

parse arg xx digs . /*obtain optional arguments from the CL*/

return r /*R is the integer square root of Z. */

/*──────────────────────────────────────────────────────────────────────────────────────*/

/*──────────────────────────────────────────────────────────────────────────────────────*/

sqrtHand: parse arg x 1 ox,##; parse value iSqrt(x) with j 1 k 1 ? /*j, k, ? ≡ iSqrt(x)*/

if ?==0 then ?= /*handle the case of sqrt < 1. */

L= length(?) /*L: used to place dec. point.*/

{{out|output|text=&nbsp; when using the default inputs:}}

<pre>

5850737212644121497099935831413222665927505592755799950501152782060571470109559971605970274534596862014728517418640889198609552329

2304843087143214508397626036279952514079896872533965463318088296406206152583523950547457502877599617298355752203375318570113543746

</pre>

{{out|output|text=&nbsp; when using the inputs of: &nbsp; &nbsp; <tt> .2 &nbsp; 80 </tt>}}

<pre>

</pre>

{{out|output|text=&nbsp; when using the inputs of: &nbsp; &nbsp; <tt> 10.89 &nbsp; 80 </tt>}}

25

</pre>

 

=={{header|Visual Basic .NET}}==

{{libheader|System.Numerics}}

 

Module Module1

If n0 > 0 Then WriteLine (VbLf & "Time taken for {0} digits: {1}", n0, DateTime.Now - st)

End Sub

 

Output with command line parameter of 500:<pre style="height:32ex; overflow:scroll; white-space:pre-wrap;">14142135623730950488016887242096980785696718753769480731766797379907324784621070388503875343276415727350138462309122970249248360558507372126441214970999358314132226659275055927557999505011527820605714701095599716059702745345968620147285174186408891986095523292304843087143214508397626036279952514079896872533965463318088296406206152583523950547457502877599617298355752203375318570113543746034084988471603868999706990048150305440277903164542478230684929369186215805784631115966687130130156185689872372

Time taken for 500 digits: 00:00:00.0263710</pre>

 

=={{header|Wren}}==

{{libheader|Wren-big}}

The original has been adjusted to deal with any non-negative number, not just integers. Where appropriate a decimal point and leading zero(s) have been added but don't count towards the required number of digits. Trailing zeros do count but have been trimmed off for display purposes.

 

var sqrt = Fn.new { |n, limit|

System.print()

i = i + 1

 

{{out}}