Byte-Sized-Chunks: Sorting and Searching Algorithms

Byte-Sized-Chunks: Sorting and Searching Algorithms, available at $39.99, has an average rating of 4.9, with 14 lectures, based on 26 reviews, and has 2646 subscribers.

You will learn about Design and implement software that use sorting and searching algorithms Understand the trade-offs, complexity and use-cases for different types of sort and search algorithms Visualise – really vividly imagine – the common data structures, and the algorithms applied to them This course is ideal for individuals who are Nope! Please don't enroll for this class if you have already enrolled for our 15-hour course 'From 0 to 1: Data Structures and Algorithms' or Yep! Computer Science and Engineering grads who are looking to really visualise data structures, and internalise how they work or Yep! Experienced software engineers who are looking to refresh important fundamental concepts It is particularly useful for Nope! Please don't enroll for this class if you have already enrolled for our 15-hour course 'From 0 to 1: Data Structures and Algorithms' or Yep! Computer Science and Engineering grads who are looking to really visualise data structures, and internalise how they work or Yep! Experienced software engineers who are looking to refresh important fundamental concepts.

Enroll now: Byte-Sized-Chunks: Sorting and Searching Algorithms

Summary

Title: Byte-Sized-Chunks: Sorting and Searching Algorithms

Price: $39.99

Average Rating: 4.9

Number of Lectures: 14

Number of Published Lectures: 14

Number of Curriculum Items: 14

Number of Published Curriculum Objects: 14

Original Price: $89.99

Quality Status: approved

Status: Live

What You Will Learn

Design and implement software that use sorting and searching algorithms
Understand the trade-offs, complexity and use-cases for different types of sort and search algorithms
Visualise – really vividly imagine – the common data structures, and the algorithms applied to them

Who Should Attend

Nope! Please don't enroll for this class if you have already enrolled for our 15-hour course 'From 0 to 1: Data Structures and Algorithms'
Yep! Computer Science and Engineering grads who are looking to really visualise data structures, and internalise how they work
Yep! Experienced software engineers who are looking to refresh important fundamental concepts

Target Audiences

Nope! Please don't enroll for this class if you have already enrolled for our 15-hour course 'From 0 to 1: Data Structures and Algorithms'
Yep! Computer Science and Engineering grads who are looking to really visualise data structures, and internalise how they work
Yep! Experienced software engineers who are looking to refresh important fundamental concepts

Note: This course is a subset of our 20+ hour course ‘From 0 to 1: Data Structures & Algorithms’ so please don’t sign up for both:-)

This is an animated, visual and spatial way to learn data structures and algorithms

Our brains process different types of information differently – evolutionarily we are wired to absorb information best when it is visual and spatial i.e. when we can close our eyes and see it
More than most other concepts, Data Structures and Algorithms are best learnt visually.These are incredibly easy to learn visually, very hard to understand most other ways
This course has been put together by a team with tons of everyday experience in thinking about these concepts and using them at work at Google, Microsoft and Flipkart

What’s Covered:

Big-O notation and complexity
Sorts: Quick, heap, merge, bubble, selection
Search: Binary searching a sorted list

Course Curriculum

Chapter 1: Needle In A Haystack: Sorting and Searching!

Lecture 1: You, This Course, and Us!

Lecture 2: Performance and Complexity

Lecture 3: Big O Notation

Lecture 4: Big O Notation More Examples

Lecture 5: Sorting Trade-Offs

Lecture 6: Selection Sort

Lecture 7: Bubble Sort

Lecture 8: Insertion Sort

Lecture 9: Shell Sort

Lecture 10: Merge Sort

Lecture 11: Quick Sort

Lecture 12: Binary Search – search quickly through a sorted list

Lecture 13: Heap Sort Phase I – Heapify

Lecture 14: Heap Sort Phase II – The Actual Sort

Instructors

Loony Corn
An ex-Google, Stanford and Flipkart team

Rating Distribution

1 stars: 0 votes
2 stars: 0 votes
3 stars: 4 votes
4 stars: 4 votes
5 stars: 18 votes

Frequently Asked Questions

How long do I have access to the course materials?

You can view and review the lecture materials indefinitely, like an on-demand channel.

Can I take my courses with me wherever I go?

Definitely! If you have an internet connection, courses on Udemy are available on any device at any time. If you don’t have an internet connection, some instructors also let their students download course lectures. That’s up to the instructor though, so make sure you get on their good side!

Menu