Commit f46e72e

committed

Updated to conform black's styling.

1 parent 92167dc commit f46e72eCopy full SHA for f46e72e

File tree

+10

-11

lines changed

+10

-11

lines changed

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -4,7 +4,7 @@`
`4`	`4`
`5`	`5`
`6`	`6`	`def counting_sort(arr):`
`7`		`- """Finding the max element in the list"""`
	`7`	`+ """Finding the max element in the list"""`
`8`	`8`	`k = max(arr) + 1`
`9`	`9`
`10`	`10`	`""" Initialing count array of len k with 0's """`

Lines changed: 4 additions & 5 deletions

Original file line number	Diff line number	Diff line change
`@@ -21,7 +21,7 @@ def __init__(self, data, prev, next):`
`21`	`21`	`class DoublyLinkedList:`
`22`	`22`	`head = None`
`23`	`23`	`tail = None`
`24`		`-`
	`24`	`+`
`25`	`25`	`def append(self, data):`
`26`	`26`	`# Creates a new node pointing to None (prev and next)`
`27`	`27`	`new_node = Node(data, None, None)`
`@@ -34,13 +34,12 @@ def append(self, data):`
`34`	`34`	`# For a non-empty list, adjust pointers to add the new node at the end`
`35`	`35`	`new_node.prev = self.tail # New node's prev points to the current tail`
`36`	`36`	`self.tail.next = new_node # Current tail's next points to the new node`
`37`		`- self.tail = new_node # Update tail to be the new node`
	`37`	`+ self.tail = new_node # Update tail to be the new node`
`38`	`38`
`39`	`39`	`# No additional 'new_node.next = None' is needed as it's already None by default`
`40`	`40`
`41`		`-`
`42`	`41`	`def delete(self, data):`
`43`		`- """Deletes a node from the list"""`
	`42`	`+ """Deletes a node from the list"""`
`44`	`43`	`""" Current node is first node in the list"""`
`45`	`44`	`curr_node = self.head`
`46`	`45`
`@@ -71,7 +70,7 @@ def delete(self, data):`
`71`	`70`	`curr_node = curr_node.next`
`72`	`71`
`73`	`72`	`def display(self):`
`74`		`- """Displays all data in the list"""`
	`73`	`+ """Displays all data in the list"""`
`75`	`74`	`print("Doubly Linked List: ")`
`76`	`75`
`77`	`76`	`# Current node is head of the list`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -12,7 +12,7 @@ def fibonacci(number):`
`12`	`12`	`"""`
`13`	`13`	`Recursive Fibonacci`
`14`	`14`	`"""`
`15`		`-`
	`15`	`+`
`16`	`16`	`if number < 2:`
`17`	`17`	`return number`
`18`	`18`	`return fibonacci(number - 1) + fibonacci(number - 2)`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -57,7 +57,7 @@ def insertion_sort_recursive(vector, index):`
`57`	`57`	`list2 = [8, 1, 3, 5, 7, 9, 0, 2, 4, 6]`
`58`	`58`	`print("Unsorted list: ")`
`59`	`59`	`print(list2)`
`60`		`-`
	`60`	`+`
`61`	`61`	`list2 = insertion_sort_recursive(list2, 1)`
`62`	`62`	`print("Sorted list with recursive insertion sort: ")`
`63`	`63`	`print(list2)`

Lines changed: 3 additions & 3 deletions

Original file line number	Diff line number	Diff line change
`@@ -2,14 +2,14 @@`
`2`	`2`
`3`	`3`
`4`	`4`	`def swap(a_list, pos1, pos2):`
`5`		`- """Swaps the position of two items in a list"""`
	`5`	`+ """Swaps the position of two items in a list"""`
`6`	`6`	`temp = a_list[pos1]`
`7`	`7`	`a_list[pos1] = a_list[pos2]`
`8`	`8`	`a_list[pos2] = temp`
`9`	`9`
`10`	`10`
`11`	`11`	`def partition(a_list, start, end):`
`12`		`- """Splits a list"""`
	`12`	`+ """Splits a list"""`
`13`	`13`	`pivot = a_list[start]`
`14`	`14`	`while True:`
`15`	`15`	`while a_list[start] < pivot:`
`@@ -28,7 +28,7 @@ def partition(a_list, start, end):`
`28`	`28`
`29`	`29`
`30`	`30`	`def quick_sort(a_list, start, end):`
`31`		`- """Quick sort algorithm"""`
	`31`	`+ """Quick sort algorithm"""`
`32`	`32`	`if start < end:`
`33`	`33`	`part = partition(a_list, start, end)`
`34`	`34`	`quick_sort(a_list, start, part)`

Comments

(0)