Python practice, assignments and practicals

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

The following algorithms are available in the algorithms directory:

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

• Implements the bubble sort algorithm.
• View Source Code

• Solves the fractional knapsack problem.
• View Source Code

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

• Implements the insertion sort algorithm.
• View Source Code

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

• Implements the linear search algorithm.
• View Source Code

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

• Performs matrix multiplication.
• View Source Code

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

• Implements the merge sort algorithm.
• View Source Code

• Merges two sorted arrays.
• View Source Code

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

• Generates permutations recursively.
• View Source Code

• Calculates factorial using recursion.
• View Source Code

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

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

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

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

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

• 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.