Loony Corn
8.1/10
(Our Score)
Product is rated as #69 in category Data Structures and Algorithms
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
What’s Covered:
Instructor Details
Votes: 0
Courses : 23
Specification: Byte-Sized-Chunks: Sorting and Searching Algorithms
|
9 reviews for Byte-Sized-Chunks: Sorting and Searching Algorithms
Show all
Most Helpful
Highest Rating
Lowest Rating
Add a review
| Price | $12.99 |
|---|---|
| Provider | |
| Duration | 3.5 hours |
| Year | 2016 |
| Level | All |
| Language | English |
| Certificate | Yes |
| Quizzes | No |
Byte-Sized-Chunks: Sorting and Searching Algorithms
$12.99
![The Design and Analysis of Algorithm Masterclass [ 2019 ]](https://courses.javacodegeeks.com/wp-content/uploads/2020/02/2484706_b943-300x300.jpg)
royal bagh –
excellent course. Clearly explained!! Highly recommended
David Hyldkrog –
It gives you a good insight in the different subjects. However so does many youtube videos. When you pay for a course you expect something extraordinary. Forinstens I had expected the code would have been explained in a step by step proces, but sometimes it is not explained at all and other times it is explained very superficial. So in general it is an ok course but not more than that, which is the reason why I only gave 3 stars.
Gonzalo Salazar –
introduction too long
Adrienne Millican –
Explains the sorting algorithms very well.
Jaclyn Jim nez –
Easy to understand. Happy i could speed it up. The code text is small though.
Richard Vannoy II –
Two things: 1. Once the student gets the idea of a particular algorithm, it would be nice to speed it up. I did it by fast forwarding a lot. 2. I spend so much time translating Indian English into USA English, that I sometimes don’t get the instructor’s point.
Christiano Coutinho –
Great course, the explanations about every sorting algorithm are very in depth and concise. I would like to suggest that Binary Search algorithm could (and should) be converted to a recursive method. It’s easier to understand. Another suggestion is to change Merge Sort in a way that it’s not necessary to duplicate memory usage. Despite that, the Course at all is a must have for anyone who wants to clarify his knowledge about sorting methods.
Ana B Sanchez Prieto –
Following this course, it is impossible not to understand the algorithms. You may forget the code, but not the principles.
Shubha Dolly Ramani –
This instructor is just amazing. Algorithms college instructors and professors should just be fired ! She explains concepts in such an intuitive way. College profs can learn a thing or two from her.