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

Popular Posts

Categories

AI (24) Android (24) AngularJS (1) Assembly Language (2) aws (17) Azure (7) BI (10) book (4) Books (101) C (77) C# (12) C++ (82) Course (60) Coursera (169) coursewra (1) Cybersecurity (22) data management (9) Data Science (73) Data Strucures (6) Deep Learning (9) Django (6) Downloads (3) edx (2) Engineering (14) Excel (13) Factorial (1) Finance (5) flutter (1) FPL (17) Google (17) Hadoop (3) HTML&CSS (46) IBM (19) IoT (1) IS (25) Java (92) Leet Code (4) Machine Learning (39) Meta (18) MICHIGAN (4) microsoft (3) Pandas (3) PHP (20) Projects (29) Python (702) Python Coding Challenge (136) Questions (2) R (70) React (6) Scripting (1) security (3) Selenium Webdriver (2) Software (17) SQL (38) UX Research (1) web application (8)

Followers

Person climbing a staircase. Learn Data Science from Scratch: online program with 21 courses