Danh mục: Python 301

Python Algorithm

Data Structures in Action: Using Binary Search Trees for Hierarchical File Systems

nqvinhtong
python 301 data structure represent hierarchical system

Problem We want to represent a hierarchical file system structure using a data structure. Folders can contain other folders and files. We need efficient access and organization for navigating through this hierarchy. Data Structure Implementation Class node Class File System Example usage Explanation This example demonstrates how a BST can be used to organize and efficiently search for files and folders within a hierarchical file system structure. You could extend this concept to include additional information within the nodes (e.g., file size, creation date) and implement functionalities like deleting files/folders…

Data Structures in Action: Using stack for undo/redo functionality in a text editor

nqvinhtong
python 301 data structure undo/redo functionality a text editor

Problem We want to implement undo/redo functionality in a text editor. When a user makes changes to the document, those edits should be stored for potential undo actions. Additionally, after undoing an edit, the user should be able to redo it. Data Structures Implementation Stack Class TechEditor Example usage You can similarly implement a redo function using a queue (optional) Explanation This example showcases how a stack can be used to maintain a history of edits, enabling users to undo their actions in a text editor. You could extend this…

Data Structures in Action: Using LinkedList for Efficient Order Tracking

nqvinhtong
python 301 data structure Efficient order tracking

Problem You’re building a simple task management application. Tasks have descriptions and priorities (high, medium, low). You need to efficiently add, remove, and display tasks while maintaining their order based on priority (high priority at the beginning). Data Structure Implementation Build Node Add Task Adds a new task with the given description and priority to the linked list. Args:description: Description of the task (string)priority: Priority level (string: “high”, “medium”, “low”) Remove task Removes the first task with the matching description from the linked list. Args:description: Description of the task to…

Data Structures in Action: Using Tuple for analyzing movie ratings

nqvinhtong
python 301 data structure analyzing movie rating

Problem You have a dataset containing movie titles, release years, and user ratings (1-5 stars). You want to analyze the data to calculate average ratings per movie and identify movies with consistently high or low ratings. Data Structure: Algorithm: Implementation Movies data (a list of tuples) Analyze movie ratting Analyze and print the result The result Benefits of using Tuples:

Data Structures in Action: Using Dictionary for managing a grocery store’s inventory

nqvinhtong
python 301 data structure managing grocery store

Problem You are tasked with managing a grocery store’s inventory. The store keeps track of various items with their names, prices, and stock quantities. You need to develop a Python program that efficiently handles this data and provides functionalities for the store staff (add, remove, update, display all, search, …). Solution Dictionary: An ideal choice to store item information. Each item can be a key, and its value can be a dictionary containing details like price and stock quantity (e.g., {“name”: “apple”, “price”: 2.5, “stock”: 100}). Implementation Add an item Allows adding…

Data Structures and Algorithms: How to Sort a List Using Merge Sort in Python

nqvinhtong
python 301 algorithms merge sort

Merge sort is a sorting algorithm that divides a list into smaller sublists, sorts them recursively, and then merges them back into a sorted list. It is based on the principle of divide and conquer, which means that it breaks down a complex problem into simpler subproblems and combines their solutions. Merge sort is one of the most efficient and stable sorting algorithms, with a time complexity of O(n log n), where n is the number of elements in the list. To perform merge sort in Python, you need to…

Data Structures and Algorithms: How to Sort a List Using Insertion Sort in Python

nqvinhtong
python 301 algorithms insertion sort

Insertion sort is a sorting algorithm that works by inserting each element of a list into its correct position in a sorted sub-list. It is similar to how we sort cards in our hands. Insertion sort is easy to implement and understand, but it is not very efficient or fast. It has a time complexity of O(n^2), which means that it takes quadratic time to sort a list of n elements. To perform insertion sort in Python, you can use a nested loop to iterate over the list and compare…

Data Structures and Algorithms: How to Sort a List Using Selection Sort in Python

nqvinhtong
python 301 Algorithms selection sort

Selection sort is a sorting algorithm that works by finding the smallest element in the unsorted part of a list and swapping it with the first element of that part. It repeats this process until the whole list is sorted. Selection sort is easy to implement and understand, but it is not very efficient or fast. It has a time complexity of O(n^2), which means that it takes quadratic time to sort a list of n elements. a selection sort example: In this example, the selection_sort function takes an array…

Data Structures and Algorithms: How to Sort a List Using Bubble Sort in Python

nqvinhtong
python 301 algorithms bubble sort

Bubble sort is a simple and common sorting algorithm that works by repeatedly swapping adjacent elements in a list that are out of order. It compares each pair of elements and moves the larger one to the right until the list is sorted. You can see an example of bubble sort in Python in this web search result. Bubble sort is easy to implement and understand, but it is not very efficient or fast. It has a time complexity of O(n^2), which means that it takes quadratic time to sort…

Data Structures and Algorithms: How to Implement and Use Binary Search Tree in Python

nqvinhtong
python 301 data structures and algorithms binary search tree bst

A binary search tree is a type of data structure that stores elements in a hierarchical order. It allows fast and efficient searching, sorting, and insertion of elements. A binary search tree has the following properties: It is called a search tree because it can be used to search for the presence of a number in O(log(n)) time. In Python, you can implement a binary search tree using a class that represents a node. Each node has a value, a left child, and a right child. You can also define methods to…