No project description provided
Project description
:space_invader: About
This code is implementing the bubble sort algorithm to sort an array of integers in ascending order. It iterates through the array and compares adjacent elements, swapping them if they are in the wrong order. The process is repeated until the array is sorted. The main function is a test case that calls the bubble_sort
function with an example array and prints the sorted result.
:wrench: Requirements
The following Python libraries are required:
:runner: Usage
In the terminal, navigate to the folder containing the code and run it using the following command:
python bubble_sort.py
:raising_hand: Contribution
All contributions are welcome! Please open an issue or submit a pull request.
Project details
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
Built Distribution
Hashes for bubble_aopy-0.1.0-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | b0dd69656623f795e1231b8b7c19f19ef3966ed8c756aa341bb334294538b986 |
|
MD5 | 26877e39f4056e3ad5e6926ba549ad06 |
|
BLAKE2b-256 | d1b53feaa5f3c906d385b5d26b23551d1e4ed63dd9b6ff6ef6b5bb0d9e011808 |