New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Fork, Commit, Merge - Medium Issue (Python) #1523
Labels
first-contributor
first-contributors
good first issue
Good for newcomers
help wanted
Extra attention is needed
medium
python
up-for-grabs
Comments
nikohoffren
added
medium
python
first-contributors
first-contributor
good first issue
Good for newcomers
help wanted
Extra attention is needed
up-for-grabs
labels
Nov 11, 2023
Harshini-Gaddam
added a commit
to Harshini-Gaddam/fork-commit-merge
that referenced
this issue
Nov 27, 2023
Rupa-Rd
added a commit
to Rupa-Rd/fork-commit-merge
that referenced
this issue
Dec 10, 2023
manikanta799
added a commit
to manikanta799/fork-commit-merge
that referenced
this issue
Dec 15, 2023
Merged
saquib000
added a commit
to saquib000/fork-commit-merge
that referenced
this issue
Feb 9, 2024
nikohoffren
added a commit
that referenced
this issue
Feb 9, 2024
fixed issue #1523 - python medium - bubble sort
Closed
Merged
SourabhRajput123
added a commit
to SourabhRajput123/fork-commit-merge
that referenced
this issue
May 3, 2024
Bubble sort repeatedly steps through the list, compares adjacent elements, and swaps them if they are in the wrong order. This process is repeated until the list is sorted. The algorithm is easy to understand and implement but not very efficient for large datasets, with a time complexity of O(n^2). The provided bubble_sort function in Python accomplishes this sorting task without using any built-in sorting methods.
SourabhRajput123
added a commit
to SourabhRajput123/fork-commit-merge
that referenced
this issue
May 3, 2024
Bubble sort repeatedly steps through the list, compares adjacent elements, and swaps them if they are in the wrong order. This process is repeated until the list is sorted. The algorithm is easy to understand and implement but not very efficient for large datasets, with a time complexity of O(n^2). The provided bubble_sort function in Python accomplishes this sorting task without using any built-in sorting methods.
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Labels
first-contributor
first-contributors
good first issue
Good for newcomers
help wanted
Extra attention is needed
medium
python
up-for-grabs
Fork, Commit, Merge - Medium Issue (Python)
Implement Bubble Sort Algorithm in Python
Note: You don't have ask permission to start solving the issue or get assigned, since these issues are supposed to be always open for new contributors. The actions-user bot will reset the file back to previous state for the next contributor after your commit is merged. So you can just simply start working with the issue right away!
How to get started
Start by opening the
tasks/python/medium
directory from the root of the project.Then open
bubble_sort.py
file and start working on your solution!Description
The goal of this issue is to implement the bubble sort algorithm in Python. The function should be able to sort an array of integers in ascending order. You should create a function called
bubble_sort
to accomplish this.Note: Do not use the
sort
function or any similar methods to solve this task.How to run
Make sure you are in the right directory:
cd tasks/python/medium
Execute the following command to run your Python script:
Expected output
If the output looks correct, you are ready to make a pull request!
To work with this issue, you need to have Python installed to your local machine.
Check out README.md for more instructions of installing Python and how to make a pull request.
Feel free to ask any questions here if you have some problems!
Also, kindly give this project a star to enhance its visibility for new developers!
The text was updated successfully, but these errors were encountered: