Python

Python practice, assignments and practicals

---

Programs

1. Python Program for factorial and fibonacci of a number. View
2. Python Program to check Armstrong Number. View
3. Program to print ASCII Value of a character. View
4. Python Program to create a function that finds the largest element in an array. View
5. Python Program to Split the array and add the first part to the end. View
6. Python program to swap two elements in a list. View
7. Python program to remove the Nth occurrence of the given word. View
8. Remove multiple elements from a list in Python. View

---

Algorithms

The following algorithms are available in the algorithms directory:

Brute Force Sorting

• Implements a brute-force sorting algorithm.
• View Source Code

Bubble Sort

• Implements the bubble sort algorithm.
• View Source Code

Fractional Knapsack

• Solves the fractional knapsack problem.
• View Source Code

Mice into Holes

• Solves the Mice into Holes problem.
• View Source Code

Insertion Sort

• Implements the insertion sort algorithm.
• View Source Code

Iterative Binary Search

• Implements the binary search algorithm iteratively.
• View Source Code

Linear Search

• Implements the linear search algorithm.
• View Source Code

Linked List

• Implements a linked list data structure.
• View Source Code

Matrix Multiplication

• Performs matrix multiplication.
• View Source Code

Merge Sort Optimized

• Implements the merge sort algorithm with optimized merging.
• View Source Code

Merge Sort

• Implements the merge sort algorithm.
• View Source Code

Merging Sorted Arrays

• Merges two sorted arrays.
• View Source Code

Palindromic Matrix Paths

• Finds palindromic paths in a matrix using dynamic programming.
• View Source Code

Recursive Permutation

• Generates permutations recursively.
• View Source Code

Recursive Factorial

• Calculates factorial using recursion.
• View Source Code

Recursive Binary Search

• Implements the binary search algorithm recursively.
• View Source Code

Strassen's Algorithm (Recursive)

• Implements Strassen's algorithm for matrix multiplication recursively.
• View Source Code

Strassen's Algorithm (Iterative)

• Implements Strassen's algorithm for matrix multiplication iteratively.
• View Source Code

Traveling Salesman Problem (Dynamic Programming)

• Solves the Traveling Salesman Problem using dynamic programming.
• View Source Code

Ugly Number (Dynamic Programming)

• Finds the nth ugly number using dynamic programming.
• View Source Code

Ugly Numbers

• Generates ugly numbers.
• View Source Code

---

For detailed explanations and implementations of the above algorithms, please refer to the respective files in the algorithms directory.