# Data Structures & Algorithms in Python: Implementing Sorting Algorithms

Python    |    Beginner
• 10 videos | 1h 10m 57s
• Includes Assessment
Rating 4.6 of 81 users (81)
Examine the Python implementation of common sorting algorithms such as selection sort, bubble sort, and insertion sort, as well as divide and conquer sorts such as shell sort, merge sort, and quicksort, in this 10-video course. Key concepts covered in this course include how to write the code to implement a selection sort; how to implement the bubble sort algorithm in Python; and how to code a function to implement the insertion sort algorithm. Next, you will observe how to write the code to implement the divide-and-conquer shell sort algorithm; how to invoke the shell sort algorithm on an array of integers and examine the output at each iteration to understand how it works; and how to code a function to implement the merge sort algorithm and test it on an array of integers. Finally, learn how to write the partition and quicksort functions in order to implement a quicksort; and how to apply quicksort on an array of integers and analyze the results at each iteration to understand how the algorithm works.

## WHAT YOU WILL LEARN

• Discover the key concepts covered in this course
Write the code to implement a selection sort
Implement the bubble sort algorithm in python
Code a function to implement the insertion sort algorithm
Write the code to implement the divide-and-conquer shell sort algorithm
• Invoke the shell sort algorithm on an array of integers and examine the output at each iteration to understand how it works
Code a function to implement the merge sort algorithm and test it on an array of integers
Write the partition and quicksort functions in order to implement a quicksort
Apply quicksort on an array of integers and analyze the results at each iteration to understand how the algorithm works
Describe the bubble sort algorithm and summarize the two functions needed to implement the quicksort algorithm

## IN THIS COURSE

• During this video, you will learn how to write the code to implement a Selection Sort algorithm.
• 3.  The Bubble Sort
In this video, you will learn how to implement the Bubble Sort algorithm in Python.
• 4.  The Insertion Sort
In this video, you will code a function to implement the Insertion Sort algorithm.
• 5.  Coding the Shell Sort Algorithm
In this video, find out how to write the code to implement the Shell Sort algorithm using the divide-and-conquer method.
• 6.  Testing and Analyzing the Shell Sort Algorithm
In this video, you will use the Shell Sort algorithm on an array of integers and examine the output at each iteration to understand how it works.
• 7.  The Merge Sort
Find out how to code a function to implement the Merge Sort algorithm and test it on an array of integers.
• 8.  Coding the Quicksort Algorithm
In this video, you will learn how to write the partition and Quicksort functions in order to implement a Quicksort.
• 9.  Testing and Analyzing the Quicksort Algorithm
In this video, you will apply Quicksort to an array of integers and analyze the results at each iteration to understand how the algorithm works.
• 10.  Exercise: Implementing Sorting Algorithms
Upon completion of this video, you will be able to describe the Bubble Sort algorithm and summarize the two functions needed to implement the Quick Sort algorithm.

## EARN A DIGITAL BADGE WHEN YOU COMPLETE THIS COURSE

Skillsoft is providing you the opportunity to earn a digital badge upon successful completion on some of our courses, which can be shared on any social network or business platform.

Digital badges are yours to keep, forever.

## YOU MIGHT ALSO LIKE

Rating 4.7 of 100 users (100)
Rating 4.6 of 80 users (80)

## PEOPLE WHO VIEWED THIS ALSO VIEWED THESE

Rating 4.6 of 4247 users (4247)
Rating 4.6 of 436 users (436)
Rating 3.8 of 19 users (19)