Saturday, 13 August 2022

Day 49 : Insertion sort using Python

 

def insertionSort(List):

    for i in range(1, len(List)):

        currentNumber = List[i]

        for j in range(i - 1, -1, -1):

            if List[j] > currentNumber :

                List[j], List[j + 1] = List[j + 1], List[j]

            else:

                List[j + 1] = currentNumber

                break


    return List


if __name__ == '__main__':

    List = [3,7,2,8,4,1,9,5]

    print('Sorted List:',insertionSort(List))

    

#clcoding.com     

Sorted List: [1, 2, 3, 4, 5, 7, 8, 9]



0 Comments:

Post a Comment

Codecademy Code Foundations

Popular Posts

Categories

Android (23) AngularJS (1) Assembly Language (2) Books (10) C (75) C# (12) C++ (81) Course (1) Data Strucures (4) Downloads (1) Engineering (13) flutter (1) FPL (17) Hadoop (1) HTML&CSS (40) IS (25) Java (89) Leet Code (4) Pandas (2) PHP (20) Projects (19) Python (434) R (69) Selenium Webdriver (2) Software (14) SQL (27)