DSA-Recurrence Relation
I am a data engineer who is responsible for designing, building, maintaining, and testing the infrastructure and systems that are used to store, process, and analyze data. I work closely with data scientists and analysts to ensure that the data pipelines and systems are able to support the data needs of an organization.
I have a strong background in computer science and software engineering, and skilled in programming languages such as Python, Java, and SQL also familiar with database systems and big data technologies like Hadoop, Spark, and NoSQL databases.
Some of my key responsibilities as a data engineer:
Designing and building data pipelines to extract, transform, and load data from various sources Setting up and maintaining data storage and processing systems, including data warehouses and data lakes Collaborating with data scientists and analysts to understand their data needs and ensure that the data infrastructure can support their requirements Performing data quality checks and troubleshooting any issues that arise Implementing security and privacy measures to protect sensitive data
Recurrence Relation
Definition of Recurrence: Function is calling itself directly or indirectly.
def fact(n):
if n==0 or n==1:
## o! = 1 and 1! = 1
return 1
else:
return n*fact(n-1)
There are three type of recurrence relation,
- Substitution Method
- Recursive Tree
- Masters Theorem
Substitution Method:
In this method we will be having only one recursive call.
Recursive Tree:
If we have more than one recursive call in a script then we call it as Recursive Tree method
Masters Theorem:
Actually I missed this class, Surly I will update this as soon as possible
