Welcome to collectivesolver - Programming & Software Q&A with code examples. A website with trusted programming answers. All programs are tested and work.

Contact: aviboots(AT)netvision.net.il

Semrush - keyword research tool

Create your online store today with Shopify

Turn ChatGPT, Claude, Gemini, And CoPilot Into Your Personal Assistant, Business Coach, Content Creator, And More

AFFILIATE MARKETING Your all-in-one performance engine Manage affiliates, creators, and customer referrals in one unified platform—turning every partnership into measurable growth

Secure & Reliable Web Hosting, Free Domain, Free SSL, 1-Click WordPress Install, Expert 24/7 Support

Disclosure: My content contains affiliate links.

43,404 questions

56,387 answers

573 users

How to write a recursive function that calculates power in Pascal

1 Answer

0 votes
program RecursivePower;

function Power(x, y: Integer): Integer;
begin
    // Base case: If the exponent is 0, return 1
    if y = 0 then
        Power := 1
    else
        // Recursive case: Multiply x with the result of Power(x, y - 1)
        Power := x * Power(x, y - 1);
end;

var
    result: Integer;
begin
    // Test cases
    WriteLn(Power(2, 3)); // Outputs 8
    WriteLn(Power(2, 4)); // Outputs 16
    WriteLn(Power(3, 2)); // Outputs 9
    WriteLn(Power(3, 3)); // Outputs 27
    WriteLn(Power(5, 4)); // Outputs 625
end.



(*
run:

8
16
9
27
625

*)

 



answered Apr 6, 2025 by avibootz
...