Scribd Logo
Upload

Welcome to Scribd!

  • Koodinäited

    Uploaded by

    Blaine Smithe
    10 views2 pages
    The document provides code examples for calculating the sum of integers from 0 to n in different programming languages: 1. FORTRAN code uses a DO loop to iterate from 0 to n, adding each integer to the running sum variable isum. 2. COBOL code uses a PERFORM loop varying the counter from 0 to n, multiplying the answer variable by the counter on each iteration. 3. LISP code recursively defines the sumto function, adding n to the result of calling sumto on n-1, with a base case of returning 0 if n is 0.

    Original Description:

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    DOC, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document provides code examples for calculating the sum of integers from 0 to n in different programming languages: 1. FORTRAN code uses a DO loop to iterate from 0 to n, adding each integer to the running sum variable isum. 2. COBOL code uses a PERFORM loop varying the counter from 0 to n, multiplying the answer variable by the counter on each iteration. 3. LISP code recursively defines the sumto function, adding n to the result of calling sumto on n-1, with a base case of returning 0 if n is 0.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOC, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    10 views2 pages

    Koodinäited

    Uploaded by

    Blaine Smithe
    The document provides code examples for calculating the sum of integers from 0 to n in different programming languages: 1. FORTRAN code uses a DO loop to iterate from 0 to n, adding each integer to the running sum variable isum. 2. COBOL code uses a PERFORM loop varying the counter from 0 to n, multiplying the answer variable by the counter on each iteration. 3. LISP code recursively defines the sumto function, adding n to the result of calling sumto on n-1, with a base case of returning 0 if n is 0.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOC, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 2

    Koodinited: 1.FORTRAN INTEGER FUNCTI0N sumto(n) isum = 0 DO i 10 = 0,n isum = isum + i 10 CONTINUE sumto = isum RETURN END . 2.

    COBOL PROCEDURE SUMTO USING N, Answer. Begin. PERFORM VARYING LoopCount FROM 0 BY 1 UNTIL LoopCount GREATER THAN N MULTIPLY Answer BY LoopCount GIVING Answer. END-PERFORM. EXIT PROGRAM. 3. LISP (defun sumto (n) (if (= 0 n) 0 (+ n (sumto ( n 1))) )). 4.sumto ja c C (ja C++ ja Java ja C#) int sumto(int n) { int i,sum = 0; for(i=0; i<=n; i=i+1) sum = sum + i; return sum; } 5.sumto,modula2 Modula-2 PROCEDURE sumto(n:INTEGER): INTEGER; VAR sum,i:INTEGER; BEGIN sum:=0; FOR i:=0 TO n DO sum:=sum+i END; RETURN sum END sumto; 6.sumto,ada Ada function sumto(n: in INTEGER) return INTEGER is sum : INTEGER := 0; begin for i in 0..n loop sum := sum + i; end loop; return sum; 7.smto,python Python def sumto(n): sum=0 for i in range(n+1):

    sum=sum+i return sum. 8.Scheme (define (good? x) (if (> 10 x) #t #f) ) (define (every? fn lst) (if (pair? lst) (if (fn (car lst)) (every? fn (cdr lst)) #f)#t)) (every? good? (10 40 50 2 100))

    You might also like