Skip to content

Added some commits in Sort section #14

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.

Sign up for GitHub

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

Merged
merged 5 commits into from
Oct 2, 2019
Merged

Added some commits in Sort section #14

Changes from 1 commit
Commits
Show all changes
5 commits
Select commit Hold shift + click to select a range
9c2ebd0
Update1: Bubble Sort(Removing Extra Iterations)
kehsihba19 Oct 1, 2019
3b5a7a3
Update 1. Bubble_Sort.ipynb
kehsihba19 Oct 1, 2019
52c4e2d
Update Quick sort comments
kehsihba19 Oct 1, 2019
cacb487
Update 5. Quick_Sort.ipynb
kehsihba19 Oct 1, 2019
2d7bd63
Update P01_Fibonnaci.py
kehsihba19 Oct 1, 2019
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Next Next commit
Update1: Bubble Sort(Removing Extra Iterations) 
Removed the extra iterations in simple bubble_sort() function, so as the real meaning of bubble sort come out.
  • Loading branch information
@kehsihba19
kehsihba19 authored Oct 1, 2019
commit 9c2ebd063902379066fec50cccf312d4d4c0bacc
5 changes: 3 additions & 2 deletions Sorting/1. Bubble_Sort.ipynb
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -16,8 +16,9 @@
"outputs": [],
"source": [
"def bubble_sort(array):\n",
" for i in range(len(array) - 1):\n",
" for j in range(len(array) - 1):\n",
" n=len(array)",
" for i in range(0,n):\n",
" for j in range(0,n-i-1):\n",
" if array[j] > array[j + 1]:\n",
" array[j], array[j + 1] = array[j + 1], array[j] # swap"
]
Expand Down