Data Structures & Algorithms in Python: Sorting Algorithms

Python    |    Beginner
  • 11 videos | 1h 14m 57s
  • Includes Assessment
  • Earns a Badge
Rating 4.5 of 183 users Rating 4.5 of 183 users (183)
In this 11-video course, learners explore workings of some of the most widely used sorting algorithms in Python and examine how their performance affects various measures. Key concepts covered here include various properties of sorting algorithms when selecting the right one for your data; the operations involved when sorting a list of values by using the selection sort algorithm; and the process of a bubble sort when applied to a list of values. Next, you will learn about the performance of the bubble sort on various measures such as time, space, and number of swaps; how to describe the steps involved in performing an insertion sort and compare it to the bubble sort; and learn the workings of the shell sort and the performance metrics of this divide and conquer algorithm. Finally, you will learn the process of sorting a list of elements using merge sort and list the complexity of this algorithm on various measures; and learn how the quicksort algorithm partitions and sorts a list of elements.

WHAT YOU WILL LEARN

  • Discover the key concepts covered in this course
    Identify the various properties of sorting algorithms that must be considered when selecting the right one for your data
    Describe the operations involved when sorting a list of values using the selection sort algorithm
    Summarize the process of a bubble sort when applied to a list of values
    Recall the performance of the bubble sort on various measures such as time, space, and number of swaps
    Describe the steps involved in performing an insertion sort and compare it to the bubble sort
  • Outline the workings of the shell sort and recall the performance metrics of this divide and conquer algorithm
    Describe the process of sorting a list of elements using merge sort and list the complexity of this algorithm on various measures
    Describe how the quicksort algorithm partitions and sorts a list of elements
    Recall the performance metrics of the quicksort algorithm
    Describe considerations for picking a sorting algorithm, list the properties of the insertion sort algorithm, and summarize the shell sort algorithm

IN THIS COURSE

  • 2m 6s
  • 5m 9s
    During this video, you will learn how to identify the various properties of sorting algorithms that you must consider when selecting the right one for your data. FREE ACCESS
  • Locked
    3.  The Selection Sort
    9m 19s
    After completing this video, you will be able to describe the operations involved when sorting a list of values using the Selection Sort algorithm. FREE ACCESS
  • Locked
    4.  The Bubble Sort - Part 1
    9m 25s
    Find out how to summarize the process of a Bubble Sort when applied to a list of values. FREE ACCESS
  • Locked
    5.  The Bubble Sort - Part 2
    3m 12s
    Upon completion of this video, you will be able to recall the performance of the Bubble Sort on various measures such as time, space, and number of swaps. FREE ACCESS
  • Locked
    6.  The Insertion Sort
    9m 57s
    After completing this video, you will be able to describe the steps involved in performing an Insertion Sort and compare it to the Bubble Sort. FREE ACCESS
  • Locked
    7.  The Shell Sort
    8m 52s
    In this video, you will learn how to outline the workings of the Shell Sort and recall the performance metrics of this divide and conquer algorithm. FREE ACCESS
  • Locked
    8.  The Merge Sort
    6m 55s
    After completing this video, you will be able to describe the process of sorting a list of elements using Merge Sort and list the complexity of this algorithm on various measures. FREE ACCESS
  • Locked
    9.  The Quicksort - Part 1
    9m 31s
    After completing this video, you will be able to describe how the Quicksort algorithm partitions and sorts a list of elements. FREE ACCESS
  • Locked
    10.  The Quicksort - Part 2
    2m 49s
    After completing this video, you will be able to recall the performance metrics of the Quicksort algorithm. FREE ACCESS
  • Locked
    11.  Exercise: Sorting Algorithms
    7m 43s
    Upon completion of this video, you will be able to describe considerations for picking a sorting algorithm, list the properties of the Insertion Sort algorithm, and summarize the Shell Sort algorithm. FREE ACCESS

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

Course Prompt Engineering to Learn Python Loops & Functions
Rating 5.0 of 1 users Rating 5.0 of 1 users (1)
Book Python Programming Using Problem-Solving
Audiobook Fast Python: High Performance Techniques for Large Datasets

PEOPLE WHO VIEWED THIS ALSO VIEWED THESE

Course Conditional Statements & Loops: While Loops in Python
Rating 4.6 of 293 users Rating 4.6 of 293 users (293)
Course Getting Started with Python: Introduction
Rating 4.6 of 4247 users Rating 4.6 of 4247 users (4247)
Course Python Concurrent Programming: Multithreading in Python
Rating 4.5 of 149 users Rating 4.5 of 149 users (149)