📚 Advanced Algorithms and Data Structures (2021)

1⃣ Join Channel Download:
https://t.iss.one/+MhmkscCzIYQ2MmM8

2⃣ Download Book: https://t.iss.one/c/1854405158/47

💬 Tags: #DataStructures #Algorithms

USEFUL CHANNELS FOR YOU

📚 Advanced Data Structures and Algorithms (2023)

1⃣ Join Channel Download:
https://t.iss.one/+MhmkscCzIYQ2MmM8

2⃣ Download Book: https://t.iss.one/c/1854405158/88

💬 Tags: #DataStructures #Algorithms

USEFUL CHANNELS FOR YOU

📚 Data Structures with Python (2023)

1⃣ Join Channel Download:
https://t.iss.one/+MhmkscCzIYQ2MmM8

2⃣ Download Book: https://t.iss.one/c/1854405158/89

💬 Tags: #DataStructures

USEFUL CHANNELS FOR YOU

📚 Data Structures the Fun Way (2022)

1⃣ Join Channel Download:
https://t.iss.one/+MhmkscCzIYQ2MmM8

2⃣ Download Book: https://t.iss.one/c/1854405158/160

💬 Tags: #DataStructures

USEFUL CHANNELS FOR YOU

📚 Linked Data (2023)

1⃣ Join Channel Download:
https://t.iss.one/+MhmkscCzIYQ2MmM8

2⃣ Download Book: https://t.iss.one/c/1854405158/171

💬 Tags: #DataStructures

USEFUL CHANNELS FOR YOU

Topic: Python List vs Tuple — Differences and Use Cases

---

Key Differences

• Lists are mutable — you can change, add, or remove elements.

• Tuples are immutable — once created, they cannot be changed.

---

Creating Lists and Tuples

my_list = [1, 2, 3]
my_tuple = (1, 2, 3)

---

When to Use Each

• Use lists when you need a collection that can change over time.

• Use tuples when the collection should remain constant, providing safer and faster data handling.

---

Common Tuple Uses

• Returning multiple values from a function.

def get_coordinates():
    return (10, 20)

x, y = get_coordinates()

• Using as keys in dictionaries (since tuples are hashable, lists are not).

---

Converting Between Lists and Tuples

list_to_tuple = tuple(my_list)
tuple_to_list = list(my_tuple)

---

Performance Considerations

• Tuples are slightly faster than lists due to immutability.

---

Summary

• Lists: mutable, dynamic collections.

• Tuples: immutable, fixed collections.

• Choose based on whether data should change or stay constant.

---

#Python #Lists #Tuples #DataStructures #ProgrammingTips

https://t.iss.one/DataScience4

Topic: Linked Lists in Python – Part 1: Introduction and Singly Linked List Basics

---

What is a Linked List?

• A linked list is a linear data structure where each element (called a node) contains:

• The data value.
• A pointer (or reference) to the next node.

• Unlike arrays, linked lists don’t require contiguous memory and can grow dynamically.

---

Why Use Linked Lists?

• Efficient insertions/deletions at the beginning or middle.
• No need for pre-defining size, unlike arrays.
• Used in memory-efficient applications like OS kernels, compilers, and real-time systems.

---

Types of Linked Lists

• Singly Linked List – Each node points to the next.
• Doubly Linked List – Nodes have next and previous pointers.
• Circular Linked List – The last node points back to the head.

---

Basic Structure of a Node

class Node:
    def __init__(self, data):
        self.data = data
        self.next = None

---

Building a Singly Linked List

class LinkedList:
    def __init__(self):
        self.head = None

    def append(self, data):
        new_node = Node(data)

        if not self.head:
            self.head = new_node
            return

        current = self.head
        while current.next:
            current = current.next
        current.next = new_node

---

Traversing the List

def display(self):
    current = self.head
    while current:
        print(current.data, end=" -> ")
        current = current.next
    print("None")

Usage:

ll = LinkedList()
ll.append(10)
ll.append(20)
ll.append(30)
ll.display()  # Output: 10 -> 20 -> 30 -> None

---

Inserting at the Beginning

def insert_at_beginning(self, data):
    new_node = Node(data)
    new_node.next = self.head
    self.head = new_node

---

Summary

• A singly linked list stores data as a sequence of nodes linked by references.

• Supports dynamic memory usage, fast insertions, and flexible resizing.

• The key is managing node connections safely and efficiently.

---

Exercise

• Implement a method length() that returns the number of nodes in the list.

---

#DataStructures #LinkedList #DSA #Python #CodingBasics

https://t.iss.one/DataScience4

Topic: Data Structures – Trees – Part 1 of 4: Introduction and Binary Trees

---

### 1. What is a Tree in Data Structures?

A tree is a non-linear hierarchical data structure consisting of nodes connected by edges. It's widely used in real-world applications like:

• File systems
• Databases (e.g., B-Trees)
• Compilers (parse trees)
• Artificial intelligence (decision trees)

---

### 2. Terminologies in Trees

• Node: Basic unit of a tree
• Root: Topmost node (only one)
• Parent/Child: A node that connects to another below/above
• Leaf: A node with no children
• Edge: Connection between parent and child
• Subtree: Any child node and its descendants
• Depth: Distance from the root to a node
• Height: Longest path from a node to a leaf
• Degree: Number of children a node has

---

### 3. Binary Tree Basics

A Binary Tree is a tree in which each node has at most two children, referred to as:

• Left child
• Right child

#### Real-life example:

Imagine a family tree where each person can have two children.

---

### 4. Types of Binary Trees

• Full Binary Tree – every node has 0 or 2 children
• Perfect Binary Tree – all internal nodes have 2 children, and all leaves are at the same level
• Complete Binary Tree – all levels are filled except possibly the last, which is filled from left to right
• Skewed Tree – all nodes only have one child (left or right)
• Balanced Binary Tree – the height difference of left and right subtrees is minimal

---

### 5. Binary Tree Representation in Python

Using Class & Object:

class Node:
    def __init__(self, data):
        self.data = data
        self.left = None
        self.right = None

# Example
root = Node(1)
root.left = Node(2)
root.right = Node(3)

---

### 6. Tree Traversals

Tree traversal means visiting all the nodes of a tree in a specific order.

• Inorder (LNR)
• Preorder (NLR)
• Postorder (LRN)
• Level Order (BFS using queue)

#### Example – Inorder Traversal (Left → Root → Right):

def inorder(root):
    if root:
        inorder(root.left)
        print(root.data, end=" ")
        inorder(root.right)

---

### 7. Build a Simple Binary Tree and Traverse It

# Tree Structure:
#      1
#     / \
#    2   3
#   / \
#  4   5

root = Node(1)
root.left = Node(2)
root.right = Node(3)
root.left.left = Node(4)
root.left.right = Node(5)

print("Inorder Traversal:")
inorder(root)  # Output: 4 2 5 1 3

---

### 8. Applications of Binary Trees

• Expression evaluation
• Search algorithms (Binary Search Trees)
• Priority queues (Heaps)
• Huffman encoding trees (data compression)
• Syntax trees in compilers

---

### 9. Key Characteristics

• Recursive nature makes tree problems suitable for recursion
• Not sequential – can't be represented with only arrays or lists
• Memory-efficient using pointers in linked structure

---

### 10. Summary

• Trees are hierarchical and non-linear
• Binary trees limit nodes to max 2 children
• Various types of binary trees serve different use cases
• Tree traversal is fundamental for solving tree problems

---

### Exercise

Create a class-based binary tree and implement:
• Inorder, Preorder, and Postorder traversals
• Function to count total nodes and leaf nodes

---

#DSA #BinaryTree #DataStructures #Python #TreeTraversal

https://t.iss.one/DataScience4

Topic: Data Structures – Trees – Part 2 of 4: Binary Search Trees (BST)

---

### 1. What is a Binary Search Tree (BST)?

A Binary Search Tree (BST) is a binary tree where all nodes follow the below properties:

• The left child of a node contains only nodes with values less than the node's value.
• The right child of a node contains only nodes with values greater than the node's value.
• Both left and right subtrees must also be BSTs.

This property allows for efficient searching, insertion, and deletion.

---

### 2. Why Use BSTs?

• Search operations are faster than in linear structures (like lists).
• Ordered traversal becomes very efficient.
• Time complexity (on average):
 • Search: O(log n)
 • Insert: O(log n)
 • Delete: O(log n)
*Worst case is O(n) for skewed trees.*

---

### 3. Implementing a BST in Python

class Node:
    def __init__(self, key):
        self.key = key
        self.left = None
        self.right = None

#### Insert Function:

def insert(root, key):
    if root is None:
        return Node(key)
    if key < root.key:
        root.left = insert(root.left, key)
    else:
        root.right = insert(root.right, key)
    return root

#### Example Tree:

root = None
for val in [50, 30, 70, 20, 40, 60, 80]:
    root = insert(root, val)

This creates:

        50
       /  \
     30    70
    / \   /  \
  20 40 60  80

---

### 4. Searching in BST

def search(root, key):
    if root is None or root.key == key:
        return root
    if key < root.key:
        return search(root.left, key)
    else:
        return search(root.right, key)

---

### 5. Finding Minimum and Maximum

def find_min(root):
    while root.left:
        root = root.left
    return root.key

def find_max(root):
    while root.right:
        root = root.right
    return root.key

---

### 6. Deleting a Node in BST

There are 3 cases:

1. Node has no children
2. Node has one child
3. Node has two children

def delete(root, key):
    if root is None:
        return root

    if key < root.key:
        root.left = delete(root.left, key)
    elif key > root.key:
        root.right = delete(root.right, key)
    else:
        # Node with only one child or no child
        if root.left is None:
            return root.right
        elif root.right is None:
            return root.left
        # Node with two children
        temp = find_min_node(root.right)
        root.key = temp.key
        root.right = delete(root.right, temp.key)

    return root

def find_min_node(node):
    while node.left:
        node = node.left
    return node

---

### 7. Inorder Traversal of BST

Inorder traversal of a BST gives sorted order:

def inorder(root):
    if root:
        inorder(root.left)
        print(root.key, end=" ")
        inorder(root.right)

---

### 8. Time and Space Complexity Summary

| Operation | Best Case | Average Case | Worst Case |
| --------- | --------- | ------------ | ---------- |
| Search | O(log n) | O(log n) | O(n) |
| Insert | O(log n) | O(log n) | O(n) |
| Delete | O(log n) | O(log n) | O(n) |

*Worst case occurs when tree is skewed (e.g., inserting sorted data)*

---

### 9. Applications of BST

• Search engines
• Sorted maps and sets
• Auto-complete features
• Database indexing
• Tree-based dictionaries

---

### 10. Summary

• BST enforces ordering which helps efficient operations
• Insertion, search, and deletion rely on recursive logic
• Traversals help in data processing
• Performance degrades in unbalanced trees — next part will cover balanced trees

---

### Exercise

• Write code to insert, delete, and search in a BST.
• Traverse the BST in inorder, preorder, and postorder.
• Add a function to count number of nodes and leaf nodes.
• Try inserting sorted data and observe tree structure (hint: use print or drawing).

#DSA #DataStructures #Tree #Python

https://t.iss.one/DataScience4

Topic: Data Structures – Trees – Part 4 of 4: Advanced Trees – Red-Black Trees and Trie

---

### 1. Introduction

This part covers two advanced and widely used tree data structures:

• Red-Black Trees – balanced search trees
• Trie (Prefix Tree) – efficient string storage and retrieval

---

### 2. Red-Black Trees (RBT)

---

#### What is a Red-Black Tree?

A Red-Black Tree is a self-balancing Binary Search Tree with extra color property:

* Each node is either red or black
* Root is always black
* Red nodes cannot have red children (no two reds in a row)
* Every path from root to leaves has the same number of black nodes (black-height)

---

#### Why Red-Black Trees?

* Guarantees O(log n) time for insert, delete, and search
* Slightly less rigid balancing than AVL but faster insertion/deletion
* Used in many libraries (e.g., C++ STL map/set)

---

#### Key Properties Recap

1. Every node is red or black
2. Root is black
3. Red nodes have black children
4. Every path from root to null leaves contains same black nodes count

---

#### Basic Operations

* Insertions and deletions are followed by color adjustments and rotations
* Ensures tree remains balanced with Red-Black properties intact

---

### 3. Trie (Prefix Tree)

---

#### What is a Trie?

A Trie is a tree-like data structure used to store a dynamic set of strings, where:

* Each node represents a character
* Path from root to leaf forms a word
* Used for prefix searches efficiently

---

#### Why Use a Trie?

• Fast lookup for words and prefixes
• Auto-complete features
• Spell checking
• IP routing (longest prefix matching)

---

#### Trie Node Structure (Python)

class TrieNode:
    def __init__(self):
        self.children = {}
        self.is_end_of_word = False

---

#### Basic Operations

Insert Word:

def insert(root, word):
    node = root
    for char in word:
        if char not in node.children:
            node.children[char] = TrieNode()
        node = node.children[char]
    node.is_end_of_word = True

Search Word:

def search(root, word):
    node = root
    for char in word:
        if char not in node.children:
            return False
        node = node.children[char]
    return node.is_end_of_word

---

### 4. Example Usage of Trie

root = TrieNode()
insert(root, "hello")
insert(root, "helium")

print(search(root, "hello"))  # True
print(search(root, "hel"))    # False (prefix only)

---

### 5. Advantages and Disadvantages

| Data Structure | Advantages | Disadvantages |
| -------------- | -------------------------------------- | ------------------------------- |
| Red-Black Tree | Balanced, efficient search and update | Complex implementation |
| Trie | Fast prefix search and auto-completion | Memory-heavy with many children |

---

### 6. Summary

* Red-Black Trees and AVL Trees both keep BSTs balanced but with different balancing rules
* Tries are specialized for string data, enabling efficient prefix operations
* Both structures are essential for advanced algorithms and systems

---

### 7. Exercise

• Implement basic Red-Black Tree insertion (research needed)
• Implement delete operation in Trie
• Use Trie to implement a simple autocomplete function
• Compare search time for BST vs Trie on string data sets

---

#DSA #RedBlackTree #Trie #AdvancedTrees #DataStructures #Python

https://t.iss.one/DataScience4

In Python, list comprehensions provide a concise way to create lists by applying an expression to each item in an iterable, often with conditions—making code more readable and efficient for tasks like filtering or transforming data, a frequent interview topic for assessing Pythonic style.

# Basic comprehension
squares = [x**2 for x in range(5)]  # [0, 1, 4, 9, 16]

# With condition
evens = [x for x in range(10) if x % 2 == 0]  # [0, 2, 4, 6, 8]

# Nested with transformation
matrix = [[1, 2], [3, 4]]
flattened = [num for row in matrix for num in row]  # [1, 2, 3, 4]

# Equivalent to loop (interview comparison)
result = []
for x in range(5):
    result.append(x**2)
# result = [0, 1, 4, 9, 16]  # Same as first example

#python #listcomprehensions #interviewtips #pythonic #datastructures

👉 @DataScience4

In Python, the collections module offers specialized container datatypes that solve real-world coding challenges with elegance and efficiency. These tools are interview favorites for optimizing time complexity and writing clean, professional code! 💡

import collections  

# defaultdict - Eliminate key errors with auto-initialization  
from collections import defaultdict  
gradebook = defaultdict(int)  
gradebook['Alice'] += 95  
print(gradebook['Alice'])  # Output: 95  
print(gradebook['Bob'])    # Output: 0  

# defaultdict for grouping operations  
anagrams = defaultdict(list)  
words = ["eat", "tea", "tan"]  
for w in words:  
    key = ''.join(sorted(w))  
    anagrams[key].append(w)  
print(anagrams['aet'])  # Output: ['eat', 'tea']  

# Counter - Frequency analysis in one line  
from collections import Counter  
text = "abracadabra"  
freq = Counter(text)  
print(freq['a'])          # Output: 5  
print(freq.most_common(2)) # Output: [('a', 5), ('b', 2)]  

# Counter arithmetic for problem-solving  
inventory = Counter(apples=10, oranges=5)  
sales = Counter(apples=3, oranges=2)  
print(inventory - sales)  # Output: Counter({'apples': 7, 'oranges': 3})  

# namedtuple - Self-documenting data structures  
from collections import namedtuple  
Employee = namedtuple('Employee', 'name role salary')  
dev = Employee('Alex', 'Developer', 95000)  
print(dev.role)           # Output: Developer  
print(dev[2])             # Output: 95000  

# deque - Optimal for BFS and sliding windows  
from collections import deque  
queue = deque([1, 2, 3])  
queue.append(4)  
queue.popleft()  
print(queue)              # Output: deque([2, 3, 4])  
queue.rotate(1)  
print(queue)              # Output: deque([4, 2, 3])  

# OrderedDict - Track insertion order (LRU cache essential)  
from collections import OrderedDict  
cache = OrderedDict()  
cache['A'] = 1  
cache['B'] = 2  
cache.move_to_end('A')  
cache.popitem(last=False)  
print(list(cache.keys())) # Output: ['B', 'A']  

# ChainMap - Manage layered configurations  
from collections import ChainMap  
defaults = {'theme': 'dark', 'font': 'Arial'}  
user_prefs = {'theme': 'light'}  
settings = ChainMap(user_prefs, defaults)  
print(settings['font'])   # Output: Arial  

# Practical Interview Tip: Anagram detection  
print(Counter("secure") == Counter("rescue"))  # Output: True  

# Pro Tip: Sliding window maximum  
def max_sliding_window(nums, k):  
    dq, result = deque(), []  
    for i, n in enumerate(nums):  
        while dq and nums[dq[-1]] < n:  
            dq.pop()  
        dq.append(i)  
        if dq[0] == i - k:  
            dq.popleft()  
        if i >= k - 1:  
            result.append(nums[dq[0]])  
    return result  
print(max_sliding_window([1,3,-1,-3,5,3,6,7], 3))  # Output: [3,3,5,5,6,7]  

# Expert Move: Custom LRU Cache implementation  
class LRUCache:  
    def __init__(self, capacity):  
        self.cache = OrderedDict()  
        self.capacity = capacity  
    def get(self, key):  
        if key not in self.cache:  
            return -1  
        self.cache.move_to_end(key)  
        return self.cache[key]  
    def put(self, key, value):  
        if key in self.cache:  
            del self.cache[key]  
        self.cache[key] = value  
        if len(self.cache) > self.capacity:  
            self.cache.popitem(last=False)  
cache = LRUCache(2)  
cache.put(1, 10)  
cache.put(2, 20)  
cache.get(1)  
cache.put(3, 30)  
print(list(cache.cache.keys()))  # Output: [2, 1, 3] → Wait! Correction: Should be [1, 3] (capacity=2 triggers eviction of '2')  

# Bonus: Multiset operations with Counter  
primes = Counter([2, 3, 5, 7])  
odds = Counter([1, 3, 5, 7, 9])  
print(primes | odds)  # Output: Counter({3:1, 5:1, 7:1, 2:1, 9:1, 1:1})  

By: @DatascienceN🌟

#Python #CodingInterview #DataStructures #collections #Programming #TechJobs #Algorithm #LeetCode #DeveloperTips #CareerGrowth

💡 Python Tips Part 4

Level up your Python code with more advanced tips. This part covers chaining comparisons, using sets for uniqueness, and powerful tools from the collections module like Counter and defaultdict.

x = 10

# Check if x is between 5 and 15 in a clean way
if 5 < x < 15:
    print("x is in range.")

# Output: x is in range.

• Chaining Comparisons: Python allows you to chain comparison operators for more readable and concise range checks. This is equivalent to (5 < x) and (x < 15).

numbers = [1, 2, 2, 3, 4, 4, 4, 5]

# Use a set to quickly get unique elements
unique_numbers = list(set(numbers))

print(unique_numbers)
# Output: [1, 2, 3, 4, 5]

• Sets for Uniqueness: Sets are unordered collections of unique elements. Converting a list to a set and back is the fastest and most Pythonic way to remove duplicates.

from collections import Counter

words = ['apple', 'banana', 'apple', 'orange', 'banana', 'apple']
word_counts = Counter(words)

print(word_counts)
# Output: Counter({'apple': 3, 'banana': 2, 'orange': 1})
print(word_counts.most_common(1))
# Output: [('apple', 3)]

• collections.Counter: A specialized dictionary subclass for counting hashable objects. It simplifies frequency counting tasks and provides useful methods like .most_common().

from collections import defaultdict

data = [('fruit', 'apple'), ('fruit', 'banana'), ('veg', 'carrot')]
grouped_data = defaultdict(list)

for category, item in data:
    grouped_data[category].append(item)

print(grouped_data)
# Output: defaultdict(<class 'list'>, {'fruit': ['apple', 'banana'], 'veg': ['carrot']})

• collections.defaultdict: A dictionary that provides a default value for a non-existent key, avoiding KeyError. It's perfect for grouping items into lists or dictionaries without extra checks.

#Python #Programming #CodeTips #DataStructures

━━━━━━━━━━━━━━━
By: @DataScience4 ✨

#37. .startswith()
Returns True if the string starts with the specified value.

filename = "document.pdf"
print(filename.startswith("doc"))

True

#38. .endswith()
Returns True if the string ends with the specified value.

filename = "image.jpg"
print(filename.endswith(".jpg"))

True

#39. .find()
Searches the string for a specified value and returns the position of where it was found. Returns -1 if not found.

text = "hello world"
print(text.find("world"))

6

#40. f-string (Formatted String Literal)
A way to embed expressions inside string literals.

name = "Alice"
age = 30
print(f"{name} is {age} years old.")

Alice is 30 years old.

---
#Python #ListMethods #DataStructures

#41. .append()
Adds an element at the end of the list.

fruits = ['apple', 'banana']
fruits.append('cherry')
print(fruits)

['apple', 'banana', 'cherry']

#42. .pop()
Removes the element at the specified position.

fruits = ['apple', 'banana', 'cherry']
fruits.pop(1) # Removes 'banana'
print(fruits)

['apple', 'cherry']

#43. .remove()
Removes the first item with the specified value.

fruits = ['apple', 'banana', 'cherry', 'banana']
fruits.remove('banana')
print(fruits)

['apple', 'cherry', 'banana']

#44. .insert()
Adds an element at the specified position.

fruits = ['apple', 'cherry']
fruits.insert(1, 'banana')
print(fruits)

['apple', 'banana', 'cherry']

#45. .sort()
Sorts the list in place.

numbers = [3, 1, 5, 2]
numbers.sort()
print(numbers)

[1, 2, 3, 5]

---
#Python #DictionaryMethods #DataStructures

#46. dict()
Creates a dictionary.

my_dict = dict(name="John", age=36)
print(my_dict)

{'name': 'John', 'age': 36}

#47. .keys()
Returns a view object displaying a list of all the keys in the dictionary.

person = {'name': 'Alice', 'age': 25}
print(person.keys())

dict_keys(['name', 'age'])

#48. .values()
Returns a view object displaying a list of all the values in the dictionary.

person = {'name': 'Alice', 'age': 25}
print(person.values())

dict_values(['Alice', 25])

#49. .items()
Returns a view object displaying a list of a given dictionary's key-value tuple pairs.

person = {'name': 'Alice', 'age': 25}
print(person.items())

dict_items([('name', 'Alice'), ('age', 25)])

#50. .get()
Returns the value of the specified key. Provides a default value if the key does not exist.

person = {'name': 'Alice', 'age': 25}
print(person.get('city', 'Unknown'))

Unknown

---
#Python #ErrorHandling #FileIO

#51. try, except
Used to handle errors and exceptions.

# Check if `n > 0` and `(n & (n - 1)) == 0`.

• Pow(x, n): Implement pow(x, n).

# Use exponentiation by squaring for an O(log n) solution.

• Majority Element:

# Boyer-Moore Voting Algorithm for an O(n) time, O(1) space solution.

• Excel Sheet Column Number:

# Base-26 conversion from string to integer.

• Valid Number:

# Use a state machine or a series of careful conditional checks.

• Integer to English Words:

# Handle numbers in chunks of three (hundreds, tens, ones) with helper functions.

• Sqrt(x): Compute and return the square root of x.

# Use binary search or Newton's method.

• Gray Code:

# Formula: `i ^ (i >> 1)`.

• Shuffle an Array:

# Implement the Fisher-Yates shuffle algorithm.

IX. Python Concepts

• Explain the GIL (Global Interpreter Lock):

# Conceptual: A mutex that allows only one thread to execute Python bytecode at a time in CPython.

• Difference between __str__ and __repr__:

# __str__ is for end-users (readable), __repr__ is for developers (unambiguous).

• Implement a Context Manager (with statement):

class MyContext:
    def __enter__(self): # setup
        return self
    def __exit__(self, exc_type, exc_val, exc_tb): # teardown
        pass

• Implement itertools.groupby logic:

# Iterate through the sorted iterable, collecting items into a sublist until the key changes.

#Python #CodingInterview #DataStructures #Algorithms #SystemDesign

━━━━━━━━━━━━━━━
By: @DataScience4 ✨

Learning Common Algorithms with Python

• This lesson covers fundamental algorithms implemented in Python. Understanding these concepts is crucial for building efficient software. We will explore searching, sorting, and recursion.

• Linear Search: This is the simplest search algorithm. It sequentially checks each element of the list until a match is found or the whole list has been searched. Its time complexity is O(n).

def linear_search(data, target):
    for i in range(len(data)):
        if data[i] == target:
            return i  # Return the index of the found element
    return -1 # Return -1 if the element is not found

# Example
my_list = [4, 2, 7, 1, 9, 5]
print(f"Linear Search: Element 7 found at index {linear_search(my_list, 7)}")

• Binary Search: A much more efficient search algorithm, but it requires the list to be sorted first. It works by repeatedly dividing the search interval in half. Its time complexity is O(log n).

def binary_search(sorted_data, target):
    low = 0
    high = len(sorted_data) - 1
    
    while low <= high:
        mid = (low + high) // 2
        if sorted_data[mid] < target:
            low = mid + 1
        elif sorted_data[mid] > target:
            high = mid - 1
        else:
            return mid # Element found
    return -1 # Element not found

# Example
my_sorted_list = [1, 2, 4, 5, 7, 9]
print(f"Binary Search: Element 7 found at index {binary_search(my_sorted_list, 7)}")

• Bubble Sort: A simple sorting algorithm that repeatedly steps through the list, compares adjacent elements and swaps them if they are in the wrong order. The process is repeated until the list is sorted. Its time complexity is O(n^2).

def bubble_sort(data):
    n = len(data)
    for i in range(n):
        # Last i elements are already in place
        for j in range(0, n-i-1):
            if data[j] > data[j+1]:
                # Swap the elements
                data[j], data[j+1] = data[j+1], data[j]
    return data

# Example
my_list_to_sort = [4, 2, 7, 1, 9, 5]
print(f"Bubble Sort: Sorted list is {bubble_sort(my_list_to_sort)}")

• Recursion (Factorial): Recursion is a method where a function calls itself to solve a problem. A classic example is calculating the factorial of a number (n!). It must have a base case to stop the recursion.

def factorial(n):
    # Base case: if n is 1 or 0, factorial is 1
    if n == 0 or n == 1:
        return 1
    # Recursive step: n * factorial of (n-1)
    else:
        return n * factorial(n - 1)

# Example
num = 5
print(f"Recursion: Factorial of {num} is {factorial(num)}")

#Python #Algorithms #DataStructures #Coding #Programming #LearnToCode

━━━━━━━━━━━━━━━
By: @DataScience4 ✨