What are Programming Languages?Types of softwaresC IntroductionC HistoryC FeaturesC ApplicationsCharacter set, ASCII TableC Programming Language Standard
Turbo C++ editor installationExploring the Turbo C++ EnvironmentC Hellow world programHow a C Program ExecuteCompilation process in C
C #include statementC Displaying OutputC Reading input from the terminalC Data typesC VariablesC Variable Naming ConventionsC ConstantsC Identifiers & Naming RulesC LiteralsC CommentsC KeywordsC Type QualifiersC TokensC Format SpecifiersC Escape SequencesC preprocessorASCII value in CStatic in CWhat are Compiler ErrorsWhat are Compiler WarningsWhat are Linker ErrorsWhat are Runtime ErrorsWhat are Logical ErrorsCompile time vs RuntimeC program to displays your name  C - Basics Practice Test.1  C - Basics Practice Test.2  C - Basics Practice Test.3  C - Basics Practice Test.4  C - Basics Practice Test.5
C Arithmetic OperatorsC Assignment OperatorsC Relational OperatorsC Logical OperatorsC Increment & Decrement OperatorsC Conditional or Ternary OperatorC Bitwise OperatorsC Type CastingC Sizeof OperatorC Comma OperatorC Operators Precedence and AssociativityC ExpressionsC Evaluation of Expressions  C - Operators Practice Test.1  C - Operators Practice Test.2  C - Operators Practice Test.3
Input-Output Library FunctionsNon-Formatted Input and OutputCharacter Oriented Library FunctionsFormatted Library FunctionsMathematical Library Functions  C - Input-Output Functions Practice Test.1
C ifC if-elseC nested if-elseC if-else-ifC switch-caseC if vs switch-caseC LoopsC while loopC do-while loopC while vs do-whileC for loopC for vs WhileC Nested LoopsC Jump Control structuresC break statementC continue statementC goto statementC continue vs goto statementC return statementC goto vs return statement  C - Control Statements Practice Test.1  C - Control Statements Practice Test.2  C - Control Statements Practice Test.3
C FunctionsC Advantages of Using FunctionsC Function PrototypeC Basic Function DesignsC Programs Using FunctionsC ScopeC Local Variable and Global VariableWhy int main() return 03 Place to declare functionsC RecursionC Base Condition in RecursionC Iteration vs RecursionC Stack Overflow Error in RecursionC Nested functionsC Variable Length Number of ArgumentsC Parameter Passing – Call by value and Call by RefC Passing Strings to FunctionsImplementation of square() functionImplementation of factorial() functionImplementation of pow(x, n) functionImplementation of reverse(int) functionImplementation of countDigits(int) functionImplementation of palindrome(int) functionImplementation of primeNumber(int) function  C - Functions Practice Test.1  C - Functions Practice Test.2
What is Array?One dimensional ArrayAccessing element of 1D arrayReading and displaying elementsPrograms on 1D ArraysTwo Dimensional ArrayAccessing Element of 2D ArrayReading and Displaying ElementsPrograms on 2D ArraysPassing 1D arrays to FunctionsPassing 2D arrays to FunctionsThree Dimensional Array  C - Array Practice Test.1  C - Array Practice Test.2
Strings in CStoring StringsC The String DelimiterC String Literals (String Constants)C Strings vs. CharactersC Declaring and Initialization of StringsC Strings and the Assignment OperatorC String Input Functions / Reading StringsC String Output Functions / Writing StringsC fscanf() and fprintf() FunctionsC Single Character Library FunctionsC String Manipulation Library FunctionsC Programs Using Character ArraysC Array of StringsC Programs Using Array of Strings  C - Strings Practice Test.1  C - Strings Practice Test.2
Pointers in CUnderstanding Memory AddressesDeclare and Initialize Pointer VariablePointer Operators in Csizeof() Operator in CPointer Advantages and DisadvantagesDereferencing/Redirecting Pointer VariablesPointer Declaration versus RedirectionConst Pointer in CVoid Pointer in CNull Pointer in CC Pointer CompatibilityArray of PointersPointer to PointerPointer ArithmeticC Functions Returning PointersC Pointer to FunctionPointers and One-Dimensional ArrayPointers and Two-Dimensional ArrayPointers and StringsDynamic Memory Allocation Functions  C - Pointers Practice Test.1  C - Pointers Practice Test.2  C - Pointers Practice Test.3
Previous
Next

C - Base Condition in Recursion

In recursion, the base condition, also known as the base case, is a fundamental part of a recursive function. It defines the scenario under which the recursive function should stop calling itself and return a result, without making further recursive calls. The base condition is essential to prevent infinite recursion, ensuring that the recursive algorithm eventually terminates.

Why the Base Condition is Crucial:
  1. Termination: The base condition provides a termination condition for the recursion. Without it, the recursive function would continue calling itself indefinitely, leading to a stack overflow or infinite loop.
  2. Solution: The base condition often returns a straightforward or known solution for the smallest possible input. It serves as the starting point for building the final result.
  3. Divide and Conquer: In many recursive algorithms, the base condition divides the problem into smaller, non-recursive subproblems. When the base condition is met, the recursion stops, and the results from the subproblems are combined to solve the original problem.
Example: Recursive Factorial Calculation

#include <stdio.h>

unsigned long long factorial(int n) {
    // Base case: If n is 0 or 1, return 1
    if (n == 0 || n == 1) {
        return 1;
    } else {
        // Recursive case: Calculate factorial(n) = n * factorial(n-1)
        return (unsigned long long)n * factorial(n - 1);
    }
}

int main() {
    int n;
    
    printf("Enter a non-negative integer: ");
    scanf("%d", &n);
    
    if (n < 0) {
        printf("Factorial is not defined for negative numbers.\n");
    } else {
        unsigned long long result = factorial(n);
        printf("Factorial of %d is %llu\n", n, result);
    }
    
    return 0;
}

In this example, the base condition is if (n == 0 || n == 1), and it returns 1 when n is 0 or 1. This prevents further recursion and provides the base case for calculating factorials. For n greater than 1, the function recursively computes the factorial by multiplying n with factorial(n - 1).

The base condition is an essential concept in recursion and plays a central role in recursive algorithms to ensure they terminate correctly and produce the expected results.

Previous
Next