Introduction to Data Structures & Algorithms in Java

Not engaging.

This review is only pertaining to the calculation illustration of the bubble sort section. When analyzing the bubble sort algorithm to calculate steps to sort, the example shown no longer used the original visual of having a basket to store an integer in for the swap function. To the intimidated eye to see the swap take 3 steps when the visual representation used seems to take 2 as the values swap spots, the student may forget that the swap takes 1 additional step, to better illustrate the actual move of the integers in the array when the compactor on the right needs to move to the left, remind the viewer that it doesn t just swap spots but that the three steps after comparison are 1 take the comparator on the left and move it to memory 2 Move one integer to the open slot 3 move the integer from the memory basket back to the array. Examining the quadratic functions moved pretty fast with how they were calculated. Any way to visually break down each for loop iteration further would be very helpful. Otherwise the explanations are done in a very approachable way for those of us who are just dipping our toes into this pool for the first time or if it has been a long time since being exposed to this material.

few new ideas poor logic flow and illustrations language accent unclear

O ingl s que o instrutor fala pra mim bem embolado, dificultando um pouco da compreens o do que ele est falando.

Its kind of old stuff I think , when you tube did not exist . Its pretty bad at the price they asked for . I think you tube is far better . courses like these should be free , in public domain .