Advanced Data Structures & Algorithms in Java: Sorting & Searching Algorithms

Java    |    Intermediate
  • 22 videos | 2h 38m 10s
  • Includes Assessment
  • Earns a Badge
Rating 4.6 of 50 users Rating 4.6 of 50 users (50)
Data structures and algorithms are vital tools in writing robust and performant code. Being trained in the proper use of these tools is the responsibility of all Software Engineers. Using these tools correctly involves recognizing which algorithms to use for which scenarios. In this course, you'll identify and implement several algorithms to sort data stored in a list. You'll explore the various trade-offs made with sorting algorithms in terms of time and space complexity. You'll recognize the nitty-gritty details of sorting algorithms such as selection sort, bubble sort, insertion sort, and divide and conquer algorithms like merge sort and quick sort. Finally, you'll learn to use searching algorithms that allow you to quickly look elements up in a sorted list such as binary search, jump search, and interpolation search.

WHAT YOU WILL LEARN

  • Discover the key concepts covered in this course
    Recognize the trade-offs involved in choosing sorting algorithms
    Describe the selection sort algorithm
    Write code to implement selection sort
    Explain the bubble sort algorithm
    Write code to implement bubble sort
    Implement adaptive bubble sort with early stopping
    Define the insertion sort algorithm
    Write code to implement insertion sort
    Summarize the shell sort algorithm
    Write code to implement shell sort
  • Describe the merge sort algorithm
    Develop methods for splitting and merging operations
    Write code to implement merge sort
    Define the quick sort algorithm
    Write code to implement quick sort
    Describe the binary search algorithm
    Design and write code for linear search
    Design and write code for binary search
    Design and write code for jump search
    Design and write code for interpolation search
    Summarize the key concepts covered in this course

IN THIS COURSE

  • 2m 2s
  • 5m 47s
    Upon completion of this video, you will be able to recognize the trade-offs involved in choosing sorting algorithms. FREE ACCESS
  • Locked
    3.  Selection Sort
    10m 2s
    Upon completion of this video, you will be able to describe the selection sort algorithm. FREE ACCESS
  • Locked
    4.  Implementing Selection Sort
    7m 37s
    In this video, learn how to write code to implement the selection sort algorithm. FREE ACCESS
  • Locked
    5.  Bubble Sort
    9m 21s
    After completing this video, you will be able to explain the bubble sort algorithm. FREE ACCESS
  • Locked
    6.  Implementing Bubble Sort
    8m 4s
    Find out how to write code to implement a bubble sort. FREE ACCESS
  • Locked
    7.  Implementing Bubble Sort With Early Stopping
    3m 32s
    During this video, you will learn how to implement adaptive bubble sort with early stopping. FREE ACCESS
  • Locked
    8.  Insertion Sort
    8m 37s
    In this video, you will learn about the insertion sort algorithm. FREE ACCESS
  • Locked
    9.  Implementing Insertion Sort
    6m 44s
    In this video, find out how to write code to implement the insertion sort algorithm. FREE ACCESS
  • Locked
    10.  Shell Sort
    11m 2s
    In this video, find out how to summarize the shell sort algorithm. FREE ACCESS
  • Locked
    11.  Implementing Shell Sort
    9m 20s
    In this video, find out how to write code to implement a shell sort. FREE ACCESS
  • Locked
    12.  Merge Sort
    8m 33s
    After completing this video, you will be able to describe the merge sort algorithm. FREE ACCESS
  • Locked
    13.  Implementing Split and Merge
    7m 42s
    In this video, you will develop methods for splitting and merging data. FREE ACCESS
  • Locked
    14.  Implementing Merge Sort
    4m 17s
    In this video, you will write code to implement the merge sort algorithm. FREE ACCESS
  • Locked
    15.  Quick Sort
    11m 24s
    In this video, you will learn how to define the quick sort algorithm. FREE ACCESS
  • Locked
    16.  Implementing Quick Sort
    9m 40s
    In this video, find out how to write code to implement the quick sort algorithm. FREE ACCESS
  • Locked
    17.  Binary Search
    4m 43s
    After completing this video, you will be able to describe the binary search algorithm. FREE ACCESS
  • Locked
    18.  Implementing Linear Search
    4m 16s
    In this video, learn how to design and write code for a linear search. FREE ACCESS
  • Locked
    19.  Implementing Binary Search
    8m 36s
    In this video, you will learn how to design and write code for binary search. FREE ACCESS
  • Locked
    20.  Implementing Jump Search
    9m 31s
    In this video, you will design and write code for a jump search. FREE ACCESS
  • Locked
    21.  Implementing Interpolation Search
    5m 47s
    In this video, learn how to design and write code for an interpolation search. FREE ACCESS
  • Locked
    22.  Course Summary
    1m 34s

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.5 of 100 users Rating 4.5 of 100 users (100)
Rating 4.5 of 206 users Rating 4.5 of 206 users (206)

PEOPLE WHO VIEWED THIS ALSO VIEWED THESE

Rating 4.3 of 46 users Rating 4.3 of 46 users (46)
Rating 4.6 of 170 users Rating 4.6 of 170 users (170)
Rating 4.6 of 15 users Rating 4.6 of 15 users (15)