FilesExpand file tree

master

/

double_sort.py

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

42 lines (40 loc) · 1.65 KB

master

/

double_sort.py

Copy path

Top

File metadata and controls

• Code
• Blame

42 lines (40 loc) · 1.65 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

42

def double_sort(lst):

"""This sorting algorithm sorts an array using the principle of bubble sort,

but does it both from left to right and right to left.

Hence, it's called "Double sort"

:param collection: mutable ordered sequence of elements

:return: the same collection in ascending order

Examples:

>>> double_sort([-1 ,-2 ,-3 ,-4 ,-5 ,-6 ,-7])

[-7, -6, -5, -4, -3, -2, -1]

>>> double_sort([])

[]

>>> double_sort([-1 ,-2 ,-3 ,-4 ,-5 ,-6])

[-6, -5, -4, -3, -2, -1]

>>> double_sort([-3, 10, 16, -42, 29]) == sorted([-3, 10, 16, -42, 29])

True

"""

no_of_elements = len(lst)

for _ in range(

0, int(((no_of_elements - 1) / 2) + 1)

): # we don't need to traverse to end of list as

for j in range(0, no_of_elements - 1):

if (

lst[j + 1] < lst[j]

): # applying bubble sort algorithm from left to right (or forwards)

temp = lst[j + 1]

lst[j + 1] = lst[j]

lst[j] = temp

if (

lst[no_of_elements - 1 - j] < lst[no_of_elements - 2 - j]

): # applying bubble sort algorithm from right to left (or backwards)

temp = lst[no_of_elements - 1 - j]

lst[no_of_elements - 1 - j] = lst[no_of_elements - 2 - j]

lst[no_of_elements - 2 - j] = temp

return lst

if __name__ == "__main__":

print("enter the list to be sorted")

lst = [int(x) for x in input().split()] # inputing elements of the list in one line

sorted_lst = double_sort(lst)

print("the sorted list is")

print(sorted_lst)