Commit b0de76e

author

Muh. Angga Muttaqien

committed

change variable

1 parent d15c7da commit b0de76eCopy full SHA for b0de76e

File tree

+10

-10

lines changed

+10

-10

lines changed

Lines changed: 2 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -13,8 +13,8 @@ def bubble_sort(collection):`
`13`	`13`
`14`	`14`	`def main():`
`15`	`15`	`print("=== Bubble Sort (Algorithm) - A simple algorithm that repeatedly steps through the list to be sorted. The algorithm is named for the way smaller or larger elements 'bubble' to the top of the list")`
`16`		`- numbers = raw_input("Enter numbers separated by a comma: ")`
`17`		`- unsorted = [int(item) for item in numbers.split(',')]`
	`16`	`+ user_input = raw_input("Enter numbers separated by a comma: ")`
	`17`	`+ unsorted = [int(item) for item in user_input.split(',')]`
`18`	`18`	`print(bubble_sort(unsorted))`
`19`	`19`
`20`	`20`	`if __name__=='__main__':`

Lines changed: 2 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -15,8 +15,8 @@ def insertion_sort(collection):`
`15`	`15`
`16`	`16`	`def main():`
`17`	`17`	`print("=== Insertion Sort (Algorithm) - An efficient, general-purpose, comparison-based sorting algorithm which most implementations produce a stable sort. Merge-sort is a divide and conquer algorithm")`
`18`		`- numbers = raw_input("Enter numbers separated by a comma: ")`
`19`		`- unsorted = [int(item) for item in numbers.split(',')]`
	`18`	`+ user_input = raw_input("Enter numbers separated by a comma: ")`
	`19`	`+ unsorted = [int(item) for item in user_input.split(',')]`
`20`	`20`	`print(insertion_sort(unsorted))`
`21`	`21`
`22`	`22`	`if __name__=='__main__':`

Lines changed: 2 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -37,8 +37,8 @@ def merge_sort(collection):`
`37`	`37`
`38`	`38`	`def main():`
`39`	`39`	`print("=== Merge Sort (Algorithm) - An efficient, general-purpose, comparison-based sorting algorithm which most implementations produce a stable sort. Merge-sort is a divide and conquer algorithm")`
`40`		`- numbers = raw_input("Enter numbers separated by a comma: ")`
`41`		`- unsorted = [int(item) for item in numbers.split(',')]`
	`40`	`+ user_input = raw_input("Enter numbers separated by a comma: ")`
	`41`	`+ unsorted = [int(item) for item in user_input.split(',')]`
`42`	`42`	`print(merge_sort(unsorted))`
`43`	`43`
`44`	`44`	`if __name__=='__main__':`

Lines changed: 2 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -14,8 +14,8 @@ def quick_sort(collection):`
`14`	`14`
`15`	`15`	`def main():`
`16`	`16`	`print("=== Quick Sort (Algorithm) - An efficient sorting algorithm, serving as a systematic method for placing the elements of an array in order. It is still commonly used algorithm for sorting which is faster than its main competitors, merge-sort and heap-sort")`
`17`		`- numbers = raw_input("Enter numbers separated by a comma: ")`
`18`		`- unsorted = [int(item) for item in numbers.split(',')]`
	`17`	`+ user_input = raw_input("Enter numbers separated by a comma: ")`
	`18`	`+ unsorted = [int(item) for item in user_input.split(',')]`
`19`	`19`	`print(quick_sort(unsorted))`
`20`	`20`
`21`	`21`	`if __name__=='__main__':`

Lines changed: 2 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -17,8 +17,8 @@ def selection_sort(collection):`
`17`	`17`
`18`	`18`	`def main():`
`19`	`19`	`print("=== Selection Sort (Algorithm) - A sorting algorithm that has thime complexity, making it inefficient on large lists, and generally performs worse than the other similar sort")`
`20`		`- numbers = raw_input("Enter numbers separated by a comma: ")`
`21`		`- unsorted = [int(item) for item in numbers.split(',')]`
	`20`	`+ user_input = raw_input("Enter numbers separated by a comma: ")`
	`21`	`+ unsorted = [int(item) for item in user_input.split(',')]`
`22`	`22`	`print(selection_sort(unsorted))`
`23`	`23`
`24`	`24`	`if __name__=='__main__':`

Comments

(0)