Posts

Showing posts with the label Python Recursion Example

Featured Post

14 Top Data Pipeline Key Terms Explained

Image
 Here are some key terms commonly used in data pipelines 1. Data Sources Definition: Points where data originates (e.g., databases, APIs, files, IoT devices). Examples: Relational databases (PostgreSQL, MySQL), APIs, cloud storage (S3), streaming data (Kafka), and on-premise systems. 2. Data Ingestion Definition: The process of importing or collecting raw data from various sources into a system for processing or storage. Methods: Batch ingestion, real-time/streaming ingestion. 3. Data Transformation Definition: Modifying, cleaning, or enriching data to make it usable for analysis or storage. Examples: Data cleaning (removing duplicates, fixing missing values). Data enrichment (joining with other data sources). ETL (Extract, Transform, Load). ELT (Extract, Load, Transform). 4. Data Storage Definition: Locations where data is stored after ingestion and transformation. Types: Data Lakes: Store raw, unstructured, or semi-structured data (e.g., S3, Azure Data Lake). Data Warehous...

How to Write Recursive Function in Python Quickly

Image
Here's an example to write RECURSIVE function in Python. It acts like a loop that iterate within the function to perform some operation. Precisely, if you call the same function from function is called  recursive function .     Python recursive function Here are four rules a developer should know before writing recursive function in Python: There must be a key variable, which will be responsible for the termination of recursion. To determine the base value , which the key variable has to meet to reach the termination. To make sure the key variable must approach the base value in every recursive call. To make the recursive function terminate when the key variable reaches the base value. Python recursive example Here is an example python recursive function. # This program computes the factorial of a number using recursion #function definition def fact(n): "computes factorial using recursion" if n == 0:     return 1 else :     return n * fact(n - 1...