Recursion | C++ | DSA

Nov 17, 2021Download as pptx, pdf0 likes195 views

The document discusses recursion and provides examples of recursive algorithms and code implementations. It defines recursion as a function calling itself directly or indirectly. Examples given include computing factorials recursively and calculating the sum of digits of a number recursively. Algorithms are presented for checking if a number is prime recursively and calculating the sum of the first N natural numbers recursively. Code snippets are included to demonstrate recursive implementations in C.

P S D S - R E C U R S I O N
It Recurs.
By - Kanan,Kirti & Sumit

The process in which a function calls itself directly or
indirectly is called recursion and the corresponding function
is called as recursive function.
Using recursive algorithm, certain problems can be solved quite easily.
The function containing recursion is called recursive function, at the end
this is a great tool in the hand of the programmers to code some
problems in a lot easier and efficient way.
In the recursive program, the solution to the base
case is provided and the solution of the bigger problem is
expressed in terms of smaller problems.
The idea is to represent a problem in terms of one or more smaller
problems, and add one or more base conditions that stop the recursion.
For example, we compute factorial n if we know factorial of (n-1).
The base case for factorial would be n = 0. We return 1 when n = 0.
WHAT IS RECURSION ?

Property Recursion Iteration
Definition Function calls itself. A set of instructions repeatedly executed.
Application For functions. For loops.
Termination Through base case, where there will be no function call.
When the termination condition for the
iterator ceases to be satisfied.
Usage
Used when code size needs to be small, and time
complexity is not an issue.
Used when time complexity needs to be
balanced against an expanded code size.
Code Size Smaller code size Larger Code Size.
Time Complexity Very high(generally exponential) time complexity.
Relatively lower time complexity
(generally polynomial-logarithmic).
RECURSION VS ITERATION

The program ‘Sum of digits’ uses recursion and counts the
sum of first N natural number.
Consider a function existed as sum and if the user pass n
to it, it will return the sum of the number and now that we
have considered that already a function is made so whenever
we will call it, it will give the result as in this code.
The user enters the Nth number as the input, the
program then calculates the sum of first N numbers using recursion
and then displays the final result.
And when the n is not equal to 0, there is no recursive call.
This returns sum of digits ultimately to the main function.
SUM TILL ‘N’ – ALGORITHM

For finding the sum of digits, we need to find all digits and sum all of them.
Finding sum of digits includes three basic steps :
1. Find last digit of number using modular division by 10.
2. Add the last digit found above to sum variable.
3. Remove last digit from given number by dividing it by 10.
Algorithm :
1. Get the number
2. Declare a variable to store the sum and set it to 0.
3. Repeat the next two steps, till the number is not 0.
4. Get the rightmost digit of the number with help of the remainder
‘%’ operator by dividing it by 10 and add it to sum.
5. Divide the number by 10 with help of '/' operator to remove
the rightmost digit.
6. Print or return the sum
SUM OF DIGITS – ALGORITHM

A Prime number is a number that is divisible only by itself and 1.
For example – 3, 5, 7, 11 etc.
To check if a number is divisible only by 1 and itself, we put every number
greater than 1 and less than the number itself in place of the divisor,
and if we find that the number is divisible by any of them, we break the
loop, and return false, otherwise it is true.
As the above method will not fall under the time constraints, we use
Recursion, in recursion, we check the base cases every single time,
until our condition falls into it, otherwise we increase the value of our divisor
which obviously starts from 2.
Check Prime Or Not – ALGORITHM

Check Prime Or Not – C Code
Output : Yes

1. The document discusses recursion and provides examples of recursively defined problems and their solutions, including factorials, powers, greatest common divisor, Fibonacci series, Towers of Hanoi, and counting cells in a blob. 2. Recursion involves breaking a problem into smaller subproblems of the same type until reaching a base case that can be solved directly. The solutions to subproblems are then combined to solve the original problem. 3. Examples of recursively defined problems include mathematical formulas, searching and sorting algorithms like binary search, and problems like Towers of Hanoi that are naturally broken down recursively.

Iterations and RecursionsAbdul Rahman Sherzad

The document discusses the differences between recursion and iteration. Recursion involves a method calling itself, with each call reducing the problem size until a base case is reached. Iteration uses loops to repeat a process. Examples include calculating factorials, Fibonacci numbers, and binary search recursively and iteratively. Some problems like directory traversal are simpler using recursion due to its divide-and-conquer approach, while iterations may be preferred for easier explanation or to avoid stack overflows with deep recursions.

Data Structures- Part5 recursionAbdullah Al-hazmy

The document discusses recursion, including: 1) Recursion involves breaking a problem down into smaller subproblems until a base case is reached, then building up the solution to the overall problem from the solutions to the subproblems. 2) A recursive function is one that calls itself, with each call typically moving closer to a base case where the problem can be solved without recursion. 3) Recursion can be linear, involving one recursive call, or binary, involving two recursive calls to solve similar subproblems.

Data Structures- Part2 analysis toolsAbdullah Al-hazmy

This document discusses algorithm analysis tools. It explains that algorithm analysis is used to determine which of several algorithms to solve a problem is most efficient. Theoretical analysis counts primitive operations to approximate runtime as a function of input size. Common complexity classes like constant, linear, quadratic, and exponential time are defined based on how quickly runtime grows with size. Big-O notation represents the asymptotic upper bound of a function's growth rate to classify algorithms.

Recursion - Algorithms and Data StructuresPriyanka Rana

Ch10 Recursionleminhvuong

The document discusses recursion, including: 1) Recursion is a programming technique where a method calls itself to solve a problem. It involves a base case and recursive calls. 2) Examples of recursive definitions and programs are given, such as computing factorials and sums recursively. 3) Recursion can be direct, where a method calls itself, or indirect through multiple method calls eventually leading back to the original method.

Data Structures- Part1 overview and reviewAbdullah Al-hazmy

This document provides an overview of the Data Structures I course. It outlines the course objectives of becoming familiar with problem solving, algorithms, data structures, and tracing algorithms. The course will cover fundamentals of data structures and algorithms, static and dynamic data structures, searching and sorting algorithms, recursion, abstract data types, stacks, queues and trees. Exams, labs, participation and quizzes will be used for grading. Pseudo-code is introduced as a way to express algorithms independent of a programming language. Examples of algorithms for determining even/odd numbers and computing weekly wages are provided.

design and analysis of algorithmMuhammad Arish

CS8451 - Design and Analysis of AlgorithmsKrishnan MuthuManickam

This document discusses analyzing the time efficiency of recursive algorithms. It provides a general 5-step plan: 1) choose a parameter for input size, 2) identify the basic operation, 3) check if operation count varies, 4) set up a recurrence relation, 5) solve the relation to determine growth order. It then gives two examples - computing factorial recursively and solving the Tower of Hanoi puzzle recursively - to demonstrate applying the plan. The document also briefly discusses algorithm visualization using static or dynamic images to convey information about an algorithm's operations and performance.

Recursion and Sorting AlgorithmsAfaq Mansoor Khan

Introduction to the AKS Primality TestPranshu Bhatnagar

The document summarizes the Agrawal-Kayal-Saxena (AKS) primality test, which can determine if a number n is prime in polynomial time. It discusses different categories of primality tests, including tests where n being prime implies the test holds, tests where the test holding implies n is prime, and the AKS test where the test holding if and only if n is prime. The AKS algorithm is described along with proof of correctness and runtime analysis showing it runs in polynomial time. An example application of the AKS test to the number 1993 is provided to demonstrate it.

PrimalityMohanasundaram Nattudurai

functions Gaditek

Recursion and loopingxcoolanurag

Iteration uses loops to repeatedly execute a block of code a specified number of times or until a condition is met. Recursion provides an alternative approach by having a function call itself repeatedly until a base case is reached. Both approaches can solve problems but recursion uses more memory than iteration due to its use of function calls and stack. Whether to use iteration or recursion depends on the specific problem and considerations of processing speed and memory usage.

RecursionAbdur Rehman

Recursion is a process where an object is defined in terms of smaller versions of itself. It involves a base case, which is the simplest definition that cannot be further reduced, and a recursive case that defines the object for larger inputs in terms of smaller ones until the base case is reached. Examples where recursion is commonly used include defining mathematical functions, number sequences, data structures, and language grammars. While recursion can elegantly solve problems, iterative algorithms are generally more efficient.

The Complexity Of Primality TestingMohammad Elsheikh

This document discusses the complexity of primality testing. It begins by explaining what prime and composite numbers are, and why primality testing is important for applications like public-key cryptography that rely on the assumption that factoring large composite numbers is computationally difficult. It then covers algorithms for primality testing like the Monte Carlo algorithm and discusses their runtime complexities. It shows that while testing if a number is composite can be done in polynomial time, general number factoring is believed to require exponential time, making primality testing an important problem.

01. design & analysis of agorithm intro & complexity analysisOnkar Nath Sharma

This document contains information about Kamalesh Karmakar, an assistant professor in the computer science department at Meghnad Saha Institute of Technology. It lists the algorithm topics he teaches, including algorithm analysis, design techniques, complexity theory, and more. It also provides references for algorithm textbooks and notes on time and space complexity analysis, asymptotic notation, and different algorithm design techniques like divide-and-conquer, dynamic programming, backtracking, and greedy methods.

Introduction to Recursion (Python)Thai Pangsakulyanont

Numerical MethodsESUG

algorithm unit 1Monika Choudhery

The document discusses algorithm analysis and design. It begins with an introduction to analyzing algorithms including average case analysis and solving recurrences. It then provides definitions of algorithms both informal and formal. Key aspects of algorithm study and specification methods like pseudocode are outlined. Selection sort and tower of Hanoi problems are presented as examples and analyzed for time and space complexity. Average case analysis is discussed assuming all inputs are equally likely.

Analysis Of Algorithms ISri Prasanna

The document discusses analyzing the running time of algorithms using Big-O notation. It begins by introducing Big-O notation and how it is used to generalize the running time of algorithms as input size grows. It then provides examples of calculating the Big-O running time of simple programs and algorithms with loops but no subprogram calls or recursion. Key concepts covered include analyzing worst-case and average-case running times, and rules for analyzing the running time of programs with basic operations and loops.

Design & Analysis Of AlgorithmComputer Hardware & Trouble shooting

Function QamarAbbasJaffari

This document contains a summary of key concepts in mathematics functions including: - Definitions of different types of functions such as polynomial, rational, trigonometric, exponential, and logarithmic functions. - Concepts related to functions like domain, range, and notation for functions. - Examples demonstrating how to find the domain and range of functions. - Key topics in trigonometry including trigonometric functions, trigonometric tables, addition formulas, laws of sines and cosines. - Concepts of limits, average and instantaneous rates of change, techniques for finding limits, and limits involving infinity.

Divide and conquerramya marichamy

Divide and conquer is a general algorithm design paradigm where a problem is divided into subproblems, the subproblems are solved independently, and the results are combined to solve the original problem. Binary search is a divide and conquer algorithm that searches for a target value in a sorted array by repeatedly dividing the search interval in half. It compares the target to the middle element of the array, and then searches either the upper or lower half depending on whether the target is greater or less than the middle element. Finding the maximum and minimum elements in an array can also be solved using divide and conquer by recursively finding the max and min of halves of the array and combining the results.

Recursionbaabtra.com - No. 1 supplier of quality freshers

This document discusses recursion in programming. It defines recursion as a procedure that calls itself, with different parameters each time. It explains the key components of a recursive method including base cases and recursive calls. It provides examples of different types of recursion like single/multiple and direct/indirect recursion. Examples of recursively defined sequences and functions like factorials and Fibonacci series are given. Contact details are provided at the end.

Divide and conquerDr Shashikant Athawale

The document discusses divide and conquer algorithms. It describes divide and conquer as a design strategy that involves dividing a problem into smaller subproblems, solving the subproblems recursively, and combining the solutions. It provides examples of divide and conquer algorithms like merge sort, quicksort, and binary search. Merge sort works by recursively sorting halves of an array until it is fully sorted. Quicksort selects a pivot element and partitions the array into subarrays of smaller and larger elements, recursively sorting the subarrays. Binary search recursively searches half-intervals of a sorted array to find a target value.

Network Security CS3-4 Infinity Tech Solutions

QUESTION BANK FOR ANNA UNNIVERISTY SYLLABUSJAMBIKA

Python_Module_2.pdfR.K.College of engg & Tech

The document discusses different types of loops in Python including while loops, for loops, and infinite loops. It provides examples of using while loops to iterate until a condition is met, using for loops to iterate over a set of elements when the number of iterations is known, and how to terminate loops early using break or skip iterations using continue. It also discusses using the range() function to generate a sequence of numbers to iterate over in for loops.

Python Programming Introduction - Loops & BooleanRuchika Sinha

More Related Content

What's hot (20)

CS8451 - Design and Analysis of AlgorithmsKrishnan MuthuManickam

Recursion and Sorting AlgorithmsAfaq Mansoor Khan

Introduction to the AKS Primality TestPranshu Bhatnagar

PrimalityMohanasundaram Nattudurai

functions Gaditek

Recursion and loopingxcoolanurag

RecursionAbdur Rehman

The Complexity Of Primality TestingMohammad Elsheikh

01. design & analysis of agorithm intro & complexity analysisOnkar Nath Sharma

Introduction to Recursion (Python)Thai Pangsakulyanont

Numerical MethodsESUG

algorithm unit 1Monika Choudhery

Analysis Of Algorithms ISri Prasanna

Design & Analysis Of AlgorithmComputer Hardware & Trouble shooting

Function QamarAbbasJaffari

Divide and conquerramya marichamy

Recursionbaabtra.com - No. 1 supplier of quality freshers

Divide and conquerDr Shashikant Athawale

Network Security CS3-4 Infinity Tech Solutions

QUESTION BANK FOR ANNA UNNIVERISTY SYLLABUSJAMBIKA

CS8451 - Design and Analysis of AlgorithmsKrishnan MuthuManickam

Recursion and Sorting AlgorithmsAfaq Mansoor Khan

Introduction to the AKS Primality TestPranshu Bhatnagar

PrimalityMohanasundaram Nattudurai

functions Gaditek

Recursion and loopingxcoolanurag

RecursionAbdur Rehman

The Complexity Of Primality TestingMohammad Elsheikh

01. design & analysis of agorithm intro & complexity analysisOnkar Nath Sharma

Introduction to Recursion (Python)Thai Pangsakulyanont

Numerical MethodsESUG

algorithm unit 1Monika Choudhery

Analysis Of Algorithms ISri Prasanna

Design & Analysis Of AlgorithmComputer Hardware & Trouble shooting

Function QamarAbbasJaffari

Divide and conquerramya marichamy

Recursionbaabtra.com - No. 1 supplier of quality freshers

Divide and conquerDr Shashikant Athawale

Network Security CS3-4 Infinity Tech Solutions

QUESTION BANK FOR ANNA UNNIVERISTY SYLLABUSJAMBIKA

Similar to Recursion | C++ | DSA (20)

Python_Module_2.pdfR.K.College of engg & Tech

Python Programming Introduction - Loops & BooleanRuchika Sinha

Course project solutions 2018Robert Geofroy

This document provides instructions and materials for a course project on solving problems using computer programming. It includes two problems - counting prime numbers below 10,000 and counting triangular numbers below 1,000,000. Algorithms are presented for both problems using pseudocode. Students are instructed to implement the algorithms in Scratch or another programming language. Sample Scratch and Python programs are included, along with testing to validate the outputs against known results. The document aims to help students learn programming skills through solving mathematical problems.

Presentation 1 on algorithm for lab progressmanjudarshan8543

TIME EXECUTION OF DIFFERENT SORTED ALGORITHMSTanya Makkar

what is Algorithm and classification and its complexity Time Complexity Time Space trade-off Asymptotic time complexity of algorithm and its notation Why do we need to classify running time of algorithm into growth rates? Big O-h notation and example Big omega notation and example Big theta notation and its example best among the 3 notation finding complexity f(n) for certain cases 1. Average case 2.Best case 3.Worst case Searching Sorting complexity of Sorting Conclusion

35000120060_Nitesh Modi_CSE Presentation on recursion.pptx15AnasKhan

The document summarizes recursion and provides examples. It begins by defining recursion as a function that calls itself directly or indirectly. It then provides examples including calculating factorials and the Towers of Hanoi problem. It discusses the different types of recursion including direct, indirect, tail, and non-tail recursion. Finally, it discusses the N-Queens problem and provides an algorithm to solve it using backtracking and recursion.

Lecture 7.pptxArul Jothi Yuvaraja

The document discusses several algorithms: 1. Program verification - A technique to mathematically prove that a program's output matches its specifications for any input. 2. Algorithm efficiency - Designing algorithms that are economical with resources like time and memory. 3. Analysis of algorithms - Qualities like correctness, understandability and efficiency. It then provides examples of algorithms for: 1. Swapping variable values 2. Counting elements that meet a condition in a set 3. Summing a set of numbers 4. Computing factorials 5. Evaluating trigonometric functions like sine

L06Saurav Rahman

This document contains examples of using for loops and while loops in MATLAB. It begins with examples of summing prime numbers, duplicating vector elements, and converting a for loop to a while loop. It then provides more examples of using loops to calculate interest, convert a matrix to a vector, print patterns of stars, and find twin prime numbers. It discusses the importance of efficiency in MATLAB and compares loop-based approaches to vectorized solutions.

C code examplesIndustrial Electric, Electronic Ind. And Trade Co. Ltd.

1. The document lists 30 programming problems commonly asked during interviews for C programming jobs. The problems cover a range of concepts like recursion, data structures, algorithms, and string manipulation. 2. Example problems include writing programs to find the factorial of a number, check if a number is prime, swap two numbers without a temporary variable, find the greatest among three numbers, and check if a number is a palindrome. 3. Many problems ask the candidate to solve the problem in unique ways, like printing text without using semicolons or specific functions. This tests their creativity and problem-solving abilities in C.

Data structures Lecture no. 4AzharIqbal710687

The document discusses algorithms and data structures. It defines an algorithm as a set of well-defined instructions to solve a problem. Some qualities of a good algorithm mentioned include having precise input/output and unambiguous steps. Algorithms should be written in a way that is not specific to any programming language. Examples of algorithms like adding two numbers and finding the largest of three numbers are provided. Data structures and algorithms are important to learn as they help solve computational problems efficiently. Factorials are used as another example to explain algorithms.

3.3 - The Math Object.pptxMaryhesterDeleon

The document discusses the Math object in Microsoft Small Basic, which provides various mathematical functions and operations. It describes properties like Pi and operations like Sin, Cos, Floor, Log, GetRandomNumber, Min, SquareRoot, and Remainder. Examples are given to demonstrate how to use each to perform calculations and randomization. In the examples, random numbers are generated to vary the size and location of shapes drawn to the screen.

3.3 the math objectallenbailey

The document discusses the various mathematical operations and properties available in the Math object in Microsoft Small Basic, including Sin, Cos, GetRandomNumber, SquareRoot, Remainder, Pi, Abs, Floor, Log, Min, and more. It provides examples of using each one to perform common mathematical tasks like calculating areas, averages, logarithms, remainders, and generating random numbers. The overall document is intended to teach the reader how to utilize the different functions of the Math object in their Small Basic programs.

Recursion vs. Iteration: Code Efficiency & Structurecogaxor346

This presentation delves into the Recursion vs. Iteration debate, highlighting their operational disparities. Recursion, though elegant, demands caution to prevent system crashes due to infinite loops. While it offers compact code, it suffers from slower execution and increased memory usage. Conversely, iteration, driven by repetition structures, boasts faster performance and lesser memory consumption. Examples illustrate the essence and application of recursion, emphasizing the need for terminating conditions. Additionally, the presentation touches upon modular programming principles and introduces lambda functions and the pass statement, elucidating their roles in code structure and execution control.

Lecture10(Repetition-Part 1) computers.pdfjayyusimagdaong24

Problem Solving PPT Slides Grade 10- 11studentschamm5

03b loopsManzoor ALam

The document discusses loops and repetition structures in C++. It explains while loops, their syntax, and how they work. A while loop repeats actions while a condition is true. Each iteration, the condition is evaluated. If true, the loop body executes and control returns to the condition. If false, execution continues after the loop. Pseudocode and C++ code examples are provided to illustrate how a while loop can be used to repeatedly purchase items from a shopping list until it is empty. Flowcharts further demonstrate the flow of control in a while loop.

Operators1.pptxHARSHSHARMA840

Operators are symbols that perform operations on data in programming languages. They allow programmers to manipulate variables and values to solve problems efficiently. The main types of operators include arithmetic, comparison, logical, assignment, bitwise, ternary, and sizeof operators. Operators are essential for tasks like data manipulation, control flow, efficient coding, and expressing code concisely. They provide flexibility and improve code understandability.

Chapter 2universidad industrial de santander

This chapter discusses numerical approximation and error analysis in numerical methods. It defines error as the difference between the true value being sought and the approximate value obtained. There are two main sources of error: rounding error from representing values with a finite number of digits, and truncation error from using a finite number of terms to approximate infinite expressions. The concept of significant figures is also introduced to determine the precision of numerical methods.

Chapter 2universidad industrial de santander

Algorithm types performance steps workingSaurabh846965

This document provides information about computers and algorithms: 1. It explains that computers are powerful machines that can perform many tasks but have no intelligence - they simply follow the step-by-step instructions provided by users or programmers. 2. It discusses the problem solving process, noting that problems must be clearly defined, analyzed, and solutions developed before coding instructions for the computer. 3. It provides definitions and examples of algorithms - step-by-step processes for solving problems that must be unambiguous, finite, and effectively coded for a computer.

Python_Module_2.pdfR.K.College of engg & Tech

Python Programming Introduction - Loops & BooleanRuchika Sinha

Course project solutions 2018Robert Geofroy

Presentation 1 on algorithm for lab progressmanjudarshan8543

TIME EXECUTION OF DIFFERENT SORTED ALGORITHMSTanya Makkar

35000120060_Nitesh Modi_CSE Presentation on recursion.pptx15AnasKhan

Lecture 7.pptxArul Jothi Yuvaraja

L06Saurav Rahman

C code examplesIndustrial Electric, Electronic Ind. And Trade Co. Ltd.

Data structures Lecture no. 4AzharIqbal710687

3.3 - The Math Object.pptxMaryhesterDeleon

3.3 the math objectallenbailey

Recursion vs. Iteration: Code Efficiency & Structurecogaxor346

Lecture10(Repetition-Part 1) computers.pdfjayyusimagdaong24

Problem Solving PPT Slides Grade 10- 11studentschamm5

03b loopsManzoor ALam

Operators1.pptxHARSHSHARMA840

Chapter 2universidad industrial de santander

Algorithm types performance steps workingSaurabh846965

More from Sumit Pandey (12)

Linear Regression | Machine Learning | Data ScienceSumit Pandey

Linear regression is a statistical method for modeling relationships between variables. Simple linear regression involves one independent variable predicting one dependent variable based on a linear equation. Multiple linear regression expands this to model relationships between multiple independent variables and one dependent variable. Linear regression finds the line of best fit that minimizes error to describe these relationships based on assumptions of homoscedasticity, independence of observations, normality, and linearity.

EDA | Exploratory Data Analysis | Machine Learning | Data ScienceSumit Pandey

Conflicts | Professionalism | BusinessSumit Pandey

The document defines and discusses different types of conflicts that can occur including intrapersonal, interpersonal, intragroup, and intergroup conflicts. It provides details on the causes and nature of each type of conflict and recommends steps that can be taken to effectively manage and resolve conflicts, such as defining the issues, examining different perspectives and solutions, and making collaborative decisions.

Social Media Writing | EnglishSumit Pandey

The document discusses social media, blogging, and writing blog posts. It defines social media as interactive technologies that allow information sharing through virtual communities and networks. Some famous platforms mentioned are Facebook, Twitter and YouTube. It then provides some etiquette tips for using social media. It defines blogging as an online journal that displays posts in reverse chronological order. Key steps for writing blog posts include understanding your audience, customizing your blog theme, coming up with a title and topic, and optimizing for search engine optimization.

Types of keys in database | SQLSumit Pandey

The document discusses different types of keys in database management systems (DBMS). It defines keys as attributes that help uniquely identify rows in database tables. The main types of keys discussed are primary keys, foreign keys, candidate keys, alternate keys, composite keys, and super keys. Primary keys uniquely identify each row and cannot contain null values or duplicates. Foreign keys link rows between tables. Candidate keys could serve as primary keys but only one is chosen. Alternate and composite keys provide other unique identifiers. Super keys may contain non-key attributes. Keys help maintain data integrity and relationships between tables in a DBMS.

Kernel | Operating SystemSumit Pandey

The document discusses the kernel of an operating system. It defines the kernel as the core component where the OS code and functionality lies. It is responsible for scheduling processes and allocating memory. The responsibilities of the kernel include device management, handling system calls, memory management, and process management. Kernel mode allows privileged access to hardware while user mode restricts this for security. The dual mode architecture prevents user programs from interfering with the OS or other processes.

Unix architecture | Operating SystemSumit Pandey

The document discusses the four layer architecture of UNIX systems: hardware, kernel, shell, and utilities. The kernel is the core component that manages processes, memory allocation, I/O, and communication between hardware and processes. It runs in privileged kernel mode while user programs run in unprivileged user mode. The shell provides an interface for users to interact with the operating system and run commands. Common shell types are Bourne and C shells. Utilities are programs that perform tasks for users like copying files. Multiple shells can run simultaneously to serve different users while only one kernel runs.

Simple past tense | English GrammarSumit Pandey

The simple past tense is used to describe events that happened in the past. It is the basic form of the past tense in English. To form the simple past, regular verbs add "-ed" to the base verb, while irregular verbs have unique past tense forms. Common regular verbs like "walked" and irregular verbs like "ran" are provided as examples. The document provides rules and examples for forming the simple past tense affirmatively, negatively, and as questions.

NETWORK SECURITY AND VIRUSESSumit Pandey

ERADICATION OF CORRUPTION IN GOVERNMENT ESTABLISHMENTSSumit Pandey

This document discusses corruption in government establishments and ways to reduce it. It defines corruption as dishonest or criminal behavior by those in positions of authority to gain illicit benefits, such as through bribery or embezzlement. It lists causes of corruption as weak civic participation, low transparency, greed, low education, instability, and moral failings. Effects include loss of faith in government, obstacles for business, unemployment, and increased accidents and deaths. Ways to reduce corruption mentioned are increasing education, transparency, accountability, public involvement in government, reforming processes, strict punishment for corruption, and surveillance of government establishments.

ARTIFICIAL INTELLIGENCESumit Pandey

GST - Good Service TaxSumit Pandey

Linear Regression | Machine Learning | Data ScienceSumit Pandey

EDA | Exploratory Data Analysis | Machine Learning | Data ScienceSumit Pandey

Conflicts | Professionalism | BusinessSumit Pandey

Social Media Writing | EnglishSumit Pandey

Types of keys in database | SQLSumit Pandey

Kernel | Operating SystemSumit Pandey

Unix architecture | Operating SystemSumit Pandey

Simple past tense | English GrammarSumit Pandey

NETWORK SECURITY AND VIRUSESSumit Pandey

ERADICATION OF CORRUPTION IN GOVERNMENT ESTABLISHMENTSSumit Pandey

ARTIFICIAL INTELLIGENCESumit Pandey

GST - Good Service TaxSumit Pandey

Recently uploaded (20)

pulse ppt.pptx Types of pulse , characteristics of pulse , Alteration of pulsesushreesangita003

Cultivation Practice of Onion in Nepal.pptxUmeshTimilsina1

How to Configure Scheduled Actions in odoo 18Celine George

YSPH VMOC Special Report - Measles Outbreak Southwest US 5-3-2025.pptxYale School of Public Health - The Virtual Medical Operations Center (VMOC)

A measles outbreak originating in West Texas has been linked to confirmed cases in New Mexico, with additional cases reported in Oklahoma and Kansas. The current case count is 817 from Texas, New Mexico, Oklahoma, and Kansas. 97 individuals have required hospitalization, and 3 deaths, 2 children in Texas and one adult in New Mexico. These fatalities mark the first measles-related deaths in the United States since 2015 and the first pediatric measles death since 2003. The YSPH Virtual Medical Operations Center Briefs (VMOC) were created as a service-learning project by faculty and graduate students at the Yale School of Public Health in response to the 2010 Haiti Earthquake. Each year, the VMOC Briefs are produced by students enrolled in Environmental Health Science Course 581 - Public Health Emergencies: Disaster Planning and Response. These briefs compile diverse information sources – including status reports, maps, news articles, and web content– into a single, easily digestible document that can be widely shared and used interactively. Key features of this report include: - Comprehensive Overview: Provides situation updates, maps, relevant news, and web resources. - Accessibility: Designed for easy reading, wide distribution, and interactive use. - Collaboration: The “unlocked" format enables other responders to share, copy, and adapt seamlessly. The students learn by doing, quickly discovering how and where to find critical information and presenting it in an easily understood manner. CURRENT CASE COUNT: 817 (As of 05/3/2025) • Texas: 688 (+20)(62% of these cases are in Gaines County). • New Mexico: 67 (+1 )(92.4% of the cases are from Eddy County) • Oklahoma: 16 (+1) • Kansas: 46 (32% of the cases are from Gray County) HOSPITALIZATIONS: 97 (+2) • Texas: 89 (+2) - This is 13.02% of all TX cases. • New Mexico: 7 - This is 10.6% of all NM cases. • Kansas: 1 - This is 2.7% of all KS cases. DEATHS: 3 • Texas: 2 – This is 0.31% of all cases • New Mexico: 1 – This is 1.54% of all cases US NATIONAL CASE COUNT: 967 (Confirmed and suspected): INTERNATIONAL SPREAD (As of 4/2/2025) • Mexico – 865 (+58) ‒Chihuahua, Mexico: 844 (+58) cases, 3 hospitalizations, 1 fatality • Canada: 1531 (+270) (This reflects Ontario's Outbreak, which began 11/24) ‒Ontario, Canada – 1243 (+223) cases, 84 hospitalizations. • Europe: 6,814

Computer crime and Legal issues Computer crime and Legal issuesAbhijit Bodhe

Myopathies (muscle disorders) for undergraduateMohamed Rizk Khodair

Rococo versus Neoclassicism. The artistic styles of the 18th centuryGema

apa-style-referencing-visual-guide-2025.pdfIshika Ghosh

Title: A Quick and Illustrated Guide to APA Style Referencing (7th Edition) This visual and beginner-friendly guide simplifies the APA referencing style (7th edition) for academic writing. Designed especially for commerce students and research beginners, it includes: ✅ Real examples from original research papers ✅ Color-coded diagrams for clarity ✅ Key rules for in-text citation and reference list formatting ✅ Free citation tools like Mendeley & Zotero explained Whether you're writing a college assignment, dissertation, or academic article, this guide will help you cite your sources correctly, confidently, and consistent. Created by: Prof. Ishika Ghosh, Faculty. 📩 For queries or feedback: [email protected]

Drive Supporter Growth from Awareness to Advocacy with TechSoup Marketing Ser...TechSoup

Ranking_Felicidade_2024_com_Educacao_Marketing Educacional_V2.pdfRafael Villas B

LDMMIA Reiki Yoga S5 Daily Living WorkshopLDM Mia eStudios

Happy May and Happy Weekend, My Guest Students. Weekends seem more popular for Workshop Class Days lol. These Presentations are timeless. Tune in anytime, any weekend. <<I am Adult EDU Vocational, Ordained, Certified and Experienced. Course genres are personal development for holistic health, healing, and self care. I am also skilled in Health Sciences. However; I am not coaching at this time.>> A 5th FREE WORKSHOP/ Daily Living. Our Sponsor / Learning On Alison: Sponsor: Learning On Alison: — We believe that empowering yourself shouldn’t just be rewarding, but also really simple (and free). That’s why your journey from clicking on a course you want to take to completing it and getting a certificate takes only 6 steps. Hopefully Before Summer, We can add our courses to the teacher/creator section. It's all within project management and preps right now. So wish us luck. Check our Website for more info: https://ldmchapels.weebly.com Get started for Free. Currency is Euro. Courses can be free unlimited. Only pay for your diploma. See Website for xtra assistance. Make sure to convert your cash. Online Wallets do vary. I keep my transactions safe as possible. I do prefer PayPal Biz. (See Site for more info.) Understanding Vibrations If not experienced, it may seem weird understanding vibes? We start small and by accident. Usually, we learn about vibrations within social. Examples are: That bad vibe you felt. Also, that good feeling you had. These are common situations we often have naturally. We chit chat about it then let it go. However; those are called vibes using your instincts. Then, your senses are called your intuition. We all can develop the gift of intuition and using energy awareness. Energy Healing First, Energy healing is universal. This is also true for Reiki as an art and rehab resource. Within the Health Sciences, Rehab has changed dramatically. The term is now very flexible. Reiki alone, expanded tremendously during the past 3 years. Distant healing is almost more popular than one-on-one sessions? It’s not a replacement by all means. However, its now easier access online vs local sessions. This does break limit barriers providing instant comfort. Practice Poses You can stand within mountain pose Tadasana to get started. Also, you can start within a lotus Sitting Position to begin a session. There’s no wrong or right way. Maybe if you are rushing, that’s incorrect lol. The key is being comfortable, calm, at peace. This begins any session. Also using props like candles, incenses, even going outdoors for fresh air. (See Presentation for all sections, THX) Clearing Karma, Letting go. Now, that you understand more about energies, vibrations, the practice fusions, let’s go deeper. I wanted to make sure you all were comfortable. These sessions are for all levels from beginner to review. Again See the presentation slides, Thx.

How to Manage Purchase Alternatives in Odoo 18Celine George

LDMMIA Reiki News Ed3 Vol1 For Team and GuestsLDM Mia eStudios

Happy May and Taurus Season. ♥☽✷♥We have a large viewing audience for Presentations. So far my Free Workshop Presentations are doing excellent on views. I just started weeks ago within May. I am also sponsoring Alison within my blog and courses upcoming. See our Temple office for ongoing weekly updates. https://ldmchapels.weebly.com ♥☽About: I am Adult EDU Vocational, Ordained, Certified and Experienced. Course genres are personal development for holistic health, healing, and self care/self serve.

How to Configure Public Holidays & Mandatory Days in Odoo 18Celine George

Lecture 1 Introduction history and institutes of entomology_1.pptxArshad Shaikh

03#UNTAGGED. Generosity in architecture.MCH

What makes space feel generous, and how architecture address this generosity in terms of atmosphere, metrics, and the implications of its scale? This edition of #Untagged explores these and other questions in its presentation of the 2024 edition of the Master in Collective Housing. The Master of Architecture in Collective Housing, MCH, is a postgraduate full-time international professional program of advanced architecture design in collective housing presented by Universidad Politécnica of Madrid (UPM) and Swiss Federal Institute of Technology (ETH). Yearbook MCH 2024. Master in Advanced Studies in Collective Housing UPM - ETH

Drugs in Anaesthesia and Intensive Care,.pdfcrewot855

What is the Philosophy of Statistics? (and how I was drawn to it)jemille6

What is the Philosophy of Statistics? (and how I was drawn to it) Deborah G Mayo At Dept of Philosophy, Virginia Tech April 30, 2025 ABSTRACT: I give an introductory discussion of two key philosophical controversies in statistics in relation to today’s "replication crisis" in science: the role of probability, and the nature of evidence, in error-prone inference. I begin with a simple principle: We don’t have evidence for a claim C if little, if anything, has been done that would have found C false (or specifically flawed), even if it is. Along the way, I’ll sprinkle in some autobiographical reflections.

Link your Lead Opportunities into Spreadsheet using odoo CRMCeline George

PHYSIOLOGY MCQS By DR. NASIR MUSTAFA (PHYSIOLOGY)Dr. Nasir Mustafa

pulse ppt.pptx Types of pulse , characteristics of pulse , Alteration of pulsesushreesangita003

Cultivation Practice of Onion in Nepal.pptxUmeshTimilsina1

How to Configure Scheduled Actions in odoo 18Celine George

YSPH VMOC Special Report - Measles Outbreak Southwest US 5-3-2025.pptxYale School of Public Health - The Virtual Medical Operations Center (VMOC)

Computer crime and Legal issues Computer crime and Legal issuesAbhijit Bodhe

Myopathies (muscle disorders) for undergraduateMohamed Rizk Khodair

Rococo versus Neoclassicism. The artistic styles of the 18th centuryGema

apa-style-referencing-visual-guide-2025.pdfIshika Ghosh

Drive Supporter Growth from Awareness to Advocacy with TechSoup Marketing Ser...TechSoup

Ranking_Felicidade_2024_com_Educacao_Marketing Educacional_V2.pdfRafael Villas B

LDMMIA Reiki Yoga S5 Daily Living WorkshopLDM Mia eStudios

How to Manage Purchase Alternatives in Odoo 18Celine George

LDMMIA Reiki News Ed3 Vol1 For Team and GuestsLDM Mia eStudios

How to Configure Public Holidays & Mandatory Days in Odoo 18Celine George

Lecture 1 Introduction history and institutes of entomology_1.pptxArshad Shaikh

03#UNTAGGED. Generosity in architecture.MCH

Drugs in Anaesthesia and Intensive Care,.pdfcrewot855

What is the Philosophy of Statistics? (and how I was drawn to it)jemille6

Link your Lead Opportunities into Spreadsheet using odoo CRMCeline George

PHYSIOLOGY MCQS By DR. NASIR MUSTAFA (PHYSIOLOGY)Dr. Nasir Mustafa

Recursion | C++ | DSA

1. P S D S - R E C U R S I O N It Recurs. By - Kanan,Kirti & Sumit

2. The process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called as recursive function. Using recursive algorithm, certain problems can be solved quite easily. The function containing recursion is called recursive function, at the end this is a great tool in the hand of the programmers to code some problems in a lot easier and efficient way. In the recursive program, the solution to the base case is provided and the solution of the bigger problem is expressed in terms of smaller problems. The idea is to represent a problem in terms of one or more smaller problems, and add one or more base conditions that stop the recursion. For example, we compute factorial n if we know factorial of (n-1). The base case for factorial would be n = 0. We return 1 when n = 0. WHAT IS RECURSION ?

3. Property Recursion Iteration Definition Function calls itself. A set of instructions repeatedly executed. Application For functions. For loops. Termination Through base case, where there will be no function call. When the termination condition for the iterator ceases to be satisfied. Usage Used when code size needs to be small, and time complexity is not an issue. Used when time complexity needs to be balanced against an expanded code size. Code Size Smaller code size Larger Code Size. Time Complexity Very high(generally exponential) time complexity. Relatively lower time complexity (generally polynomial-logarithmic). RECURSION VS ITERATION

4. The program ‘Sum of digits’ uses recursion and counts the sum of first N natural number. Consider a function existed as sum and if the user pass n to it, it will return the sum of the number and now that we have considered that already a function is made so whenever we will call it, it will give the result as in this code. The user enters the Nth number as the input, the program then calculates the sum of first N numbers using recursion and then displays the final result. And when the n is not equal to 0, there is no recursive call. This returns sum of digits ultimately to the main function. SUM TILL ‘N’ – ALGORITHM

5. Sum Till ‘N’ – C Code Output : 10

6. For finding the sum of digits, we need to find all digits and sum all of them. Finding sum of digits includes three basic steps : 1. Find last digit of number using modular division by 10. 2. Add the last digit found above to sum variable. 3. Remove last digit from given number by dividing it by 10. Algorithm : 1. Get the number 2. Declare a variable to store the sum and set it to 0. 3. Repeat the next two steps, till the number is not 0. 4. Get the rightmost digit of the number with help of the remainder ‘%’ operator by dividing it by 10 and add it to sum. 5. Divide the number by 10 with help of '/' operator to remove the rightmost digit. 6. Print or return the sum SUM OF DIGITS – ALGORITHM

7. Sum Of Digits – C Code Output : 4

8. A Prime number is a number that is divisible only by itself and 1. For example – 3, 5, 7, 11 etc. To check if a number is divisible only by 1 and itself, we put every number greater than 1 and less than the number itself in place of the divisor, and if we find that the number is divisible by any of them, we break the loop, and return false, otherwise it is true. As the above method will not fall under the time constraints, we use Recursion, in recursion, we check the base cases every single time, until our condition falls into it, otherwise we increase the value of our divisor which obviously starts from 2. Check Prime Or Not – ALGORITHM

9. Check Prime Or Not – C Code Output : Yes

Editor's Notes

#2: Kanan
#3: Kirti
#4: SumitA program is called recursive when an entity calls itself. A program is call iterative when there is a loop (or repetition).
#5: Kana
#6: kanan
#7: Kirti
#8: kirti
#9: Sumit
#10: Sumit
#11: Kanan
#12: Everyone

Recursion | C++ | DSA

Recommended

More Related Content

What's hot (20)

Similar to Recursion | C++ | DSA (20)

More from Sumit Pandey (12)

Recently uploaded (20)

Recursion | C++ | DSA

Editor's Notes