User:NevilleDNZ/GeSHi sandbox

with Ada.Text_Io; use Ada.Text_Io;
 
 procedure Gcd_Test is
    function Gcd (A, B : Integer) return Integer is
    begin
       if A = 0 then
          return B;
       end if;
       if B = 0 then
          return A;
       end if;
       if A > B then
          return Gcd(B, A mod B);
       else
          return Gcd(A, B mod A);
       end if;
    end Gcd;
 
 begin
    Put_Line("GCD of 100, 5 is" & Integer'Image(Gcd(100, 5)));
    Put_Line("GCD of 5, 100 is" & Integer'Image(Gcd(5, 100)));
    Put_Line("GCD of 7, 23 is" & Integer'Image(Gcd(7, 23)));
 end Gcd_Test;

GeSHi Error: GeSHi could not find the language algol-68 (using path /usr/local/apache/common-local/php-1.5/lib/GeSHi-1.0.7.19-wm1/geshi/) (code 2)

You need to specify a language like this: <source lang="html">...</source>

Supported languages for syntax highlighting:

actionscript, ada, apache, applescript, asm, asp, autoit, bash, blitzbasic, bnf, c, c_mac, caddcl, cadlisp, cfdg, cfm, cpp, cpp-qt, csharp, css, d, delphi, diff, div, dos, eiffel, fortran, freebasic, gml, groovy, html4strict, idl, ini, inno, io, java, java5, javascript, latex, lisp, lua, matlab, mirc, mpasm, mysql, nsis, objc, ocaml, ocaml-brief, oobas, oracle8, pascal, perl, php, php-brief, plsql, python, qbasic, rails, reg, robots, ruby, sas, scheme, sdlbasic, smalltalk, smarty, sql, tcl, text, thinbasic, tsql, vb, vbnet, vhdl, visualfoxpro, winbatch, xml, xpp, z80

int
 gcd_iter(int u, int v) {
   int t;
   while (v) {
     t = u; 
     u = v; 
     v = t % v;
   }
   return u < 0 ? -u : u; /* abs(u) */
 }

int
 gcd(int u, int v) {
   if (v)
     return gcd(v, u % v);
   else 
     return u < 0 ? -u : u; /* abs(u) */
 }

int
gcd_bin(int u, int v) {
  int t, k;
 
  u = u < 0 ? -u : u; /* abs(u) */
  v = v < 0 ? -v : v; 
  if (u < v) {
    t = u;
    u = v;
    v = t;
  }
  if (v == 0)
    return u;
 
  k = 1;
  while (u & 1 == 0 && v & 1 == 0) { /* u, v - even */
    u >>= 1; v >>= 1;
    k <<= 1;
  }
 
  t = (u & 1) ? -v : u;
  while (t) {
    while (t & 1 == 0) 
      t >>= 1;
 
    if (t > 0)
      u = t;
    else
      v = -t;
 
    t = u - v;
  }
  return u * k;        
}

GeSHi Error: GeSHi could not find the language forth (using path /usr/local/apache/common-local/php-1.5/lib/GeSHi-1.0.7.19-wm1/geshi/) (code 2)

You need to specify a language like this: <source lang="html">...</source>

Supported languages for syntax highlighting:

actionscript, ada, apache, applescript, asm, asp, autoit, bash, blitzbasic, bnf, c, c_mac, caddcl, cadlisp, cfdg, cfm, cpp, cpp-qt, csharp, css, d, delphi, diff, div, dos, eiffel, fortran, freebasic, gml, groovy, html4strict, idl, ini, inno, io, java, java5, javascript, latex, lisp, lua, matlab, mirc, mpasm, mysql, nsis, objc, ocaml, ocaml-brief, oobas, oracle8, pascal, perl, php, php-brief, plsql, python, qbasic, rails, reg, robots, ruby, sas, scheme, sdlbasic, smalltalk, smarty, sql, tcl, text, thinbasic, tsql, vb, vbnet, vhdl, visualfoxpro, winbatch, xml, xpp, z80

subro utine gcd_iter(value, u, v)
 Cf2py integer intent(out) :: value
       int eger value, u, v, t
       intrinsic abs, mod
 C
       dowhile( v.NE.0 )
       do while( v.NE.0 )
          t = u
          u = v
          v = mod(t, v)
       end do
       enddo
       value = abs(u)
       end subroutine gcd_iter

subroutine gcd_bin(value, u, v)
 Cf2py integer intent(out) :: value
       integer value, u, v, k, t, abs, mod
       intrinsic abs, mod
       u = abs(u)
       v = abs(v)
       if( u.lt.v ) then
          t = u
          u = v
          v = t
       endif
       if( v.eq.0 ) then
          value = u
          return
       endif
       k = 1
       do while( (mod(u, 2).eq.0).and.(mod(v, 2).eq.0) )
          u = u / 2
          v = v / 2
          k = k * 2
       enddo
       if( (mod(u, 2).eq.0) ) then
          t = u
       else
          t = -v
       endif
       do while( t.ne.0 )
          do while( (mod(t, 2).eq.0) )
             t = t / 2
          enddo
          if( t.gt.0 ) then
             u = t
          else
             v = -t
          endif
          t = u - v
       enddo
       value = u * k
       end subroutine gcd_bin

GeSHi Error: GeSHi could not find the language j (using path /usr/local/apache/common-local/php-1.5/lib/GeSHi-1.0.7.19-wm1/geshi/) (code 2)

You need to specify a language like this: <source lang="html">...</source>

Supported languages for syntax highlighting:

actionscript, ada, apache, applescript, asm, asp, autoit, bash, blitzbasic, bnf, c, c_mac, caddcl, cadlisp, cfdg, cfm, cpp, cpp-qt, csharp, css, d, delphi, diff, div, dos, eiffel, fortran, freebasic, gml, groovy, html4strict, idl, ini, inno, io, java, java5, javascript, latex, lisp, lua, matlab, mirc, mpasm, mysql, nsis, objc, ocaml, ocaml-brief, oobas, oracle8, pascal, perl, php, php-brief, plsql, python, qbasic, rails, reg, robots, ruby, sas, scheme, sdlbasic, smalltalk, smarty, sql, tcl, text, thinbasic, tsql, vb, vbnet, vhdl, visualfoxpro, winbatch, xml, xpp, z80

public static long gcd(long a, long b){
    long factor= 0;
    factor= Math.max(a, b);
    for(long loop= factor;loop > 1;loop--){
       if(a % loop == 0 && b % loop == 0){
          return loop;
       }
    }
    return 1;
 }

public static long gcd(long a, long b){
    if(a == 0) return b;
    if(b == 0) return a;
    if(a > b) return gcd(b, a % b);
    return gcd(a, b % a);
 }

let rec gcd a b =
   if      a = 0 then b
   else if b = 0 then a
   else if a > b then gcd b (a mod b)
   else               gcd a (b mod a)

sub gcd_iter($$) {
   ($u, $v) = @_;
   while ($v) {
     $t = $u;
     $u = $v;
     $v = $t % $v;
   }
   return abs($u);
 }

sub gcd($$) {
   ($u, $v) = @_;
   if ($v) {
     return gcd($v, $u % $v);
   } else {
     return abs($u);
   }
 }

sub gcd_bin($$) {
   ($u, $v) = @_;
   $u = abs($u);
   $v = abs($v);
   if ($u < $v) {
     $t = $u;
     $u = $v;
     $v = $t;
   }
   if ($v == 0) {
     return $u;
   }
   $k = 1;
   while ($u & 1 == 0 && $v & 1 == 0) {
     $u >>= 1;
     $v >>= 1;
     $k <<= 1;
   }
   $t = ($u & 1) ? -$v : $u;
   while ($t) {
     while ($t & 1 == 0) {
       $t >>= 1;
     }
     if ($t > 0) {
       $u = $t;
     } else {
       $v = -$t;
     }
     $t = $u - $v;
   }
   return $u * $k;
 }

use Benchmark qw(cmpthese);
 
 $u = 40902;
 $v = 24140;
 (-5, {
   'gcd' => sub { gcd($u, $v); },
   'gcd_iter' => sub { gcd_iter($u, $v); },
   'gcd_bin' => sub { gcd_bin($u, $v); },
 });

def gcd_iter(u, v):
     while v:
         u, v = v, u % v
     return abs(u)

def gcd(u, v):
     return gcd(v, u % v) if v else abs(u)
<python>
===Tests===
 >>> gcd(0,0)
 0
 >>> gcd(0, 10) == gcd(10, 0) == gcd(-10, 0) == gcd(0, -10) == 10
 True
 >>> gcd(9, 6) == gcd(6, 9) == gcd(-6, 9) == gcd(9, -6) == gcd(6, -9) == gcd(-9, 6) == 3
 True
 >>> gcd(8, 45) == gcd(45, 8) == gcd(-45, 8) == gcd(8, -45) == gcd(-8, 45) == gcd(45, -8) == 1
 True
 >>> gcd(40902, 24140) # check Knuth :)
 34
 
===Iterative binary algorithm===
See [[The Art of Computer Programming]] by Knuth (Vol.2)>
<source lang=python>
 def gcd_bin(u, v):
     u, v = abs(u), abs(v) # u >= 0, v >= 0
     if u < v:
         u, v = v, u # u >= v >= 0
     if v == 0:
         return u
 
     # u >= v > 0
     k = 1
     while u & 1 == 0 and v & 1 == 0: # u, v - even
         u >>= 1; v >>= 1
         k <<= 1
 
     t = -v if u & 1 else u
     while t:
         while t & 1 == 0:
             t >>= 1
         if t > 0:
             u = t
         else:
             v = -t
         t = u - v
     return u * k