Dynamic Array Code

[@iqbalibrahim4713]

thank goodness all your examples are in java, because there are so many videos show algo in c++, and luckily I found you, thank god your a life saviour

[@shankar7435]

Thinking the same here..😂😂😂

[@kaushik1001]

Content is absolute gem.

[@Alex-de7rz]

This channel is a hidden gem.

[@AbhishekZambre]

I think the check at line 48 should have OR condition rather than AND. if(rm_index >= len || rm_index < 0) throw new IndexOutOfBoundsException();

[@karuneshpal8908]

u r right Abhishek

[@sandeepharidasula3191]

Thank you so much for sharing your knowledge.

[@Colstonewall]

Thanks, William!

[@superoxidedismutase5757]

your voice is so relaxing

[@rahulgawale]

Thank you very much for the detailed video.

[@CoolCoder_]

Good job on the implementation but I would love to see better code comments! :D

[@JayPatel12928]

In clear(), why do we loop through the array and explicitly set each element to null? Can't we just reassign `arr` to a brand new list? assuming the detached old array would be garbage collected automatically? I want to understand the reasoning behind this decision.

[@yahyafati]

Thanks for this great course. It is an amazing course, and I have learnt a lot so far. I have done an hour of the course so far and I have a question. In the implementation of the Dynamic Array why is the capacity of the array changed after removal of an element. I get that it's size(len) changes, but why is the capacity reset aswell?

[@jakenguyen2584]

I was wondering the same thing about setting the capacity to len--. I think it should be len-- instead of capacity = len--;

[@rusticExploration]

removeAt might give undesired result , if index is equal to 0 and previously length was one, at line 50

[@I_dont_want_an_id]

May this encourage your faith facebook.com/esther.chester77/videos/1029971633787995/ kzbin.info/www/bejne/o3rbfJ9vgL6qhLc m.facebook.com/story.php?story_fbid=2582272895211292&id=490097534428849 m.kzbin.info/www/bejne/e3aVpH1jjK6ZqtU kzbin.info/www/bejne/h6iVmaqZpMiJrK8 m.facebook.com/story.php?story_fbid=777934336005747&id=100013675634259

[@bharpursingh]

2.11 What is the meaning of balanced check, that he is not doing?

[@amanbhatia7442]

Hi William, I dont understand why have you set capacity to len - 1 in removeAt. Couldnt we just do away with decrementing length?

[@jovanpetrovic168]

I agree with you

[@MrManUnited1231]

Shouldn't the operator on line 48 be a logical or "||" instead of logical and?

[@blairbass84]

I caught this as well. Definitely || instead of &&

[@arhamshafiqexplains]

Why have you used Object instead of Generics T as arguments in the remove(), indexOf(), and contains() methods?

[@saschion]

how would i create a array like this and how i use the methods?

[@brayaon]

what editor is that?? Thank you for share your knowledge

[@WilliamFiset-videos]

sublime text

[@mjaesthetics9300]

this looks like implementation of ArrayList in java. Is that right?

[@ppchavan001]

4:50 is'nt that code going crash if you remove indexAt 0?

[@buihung3704]

Also, why T arr = (T[]) new Object[capacity] ? Why don't u write T arr = new T[capacity]?

[@alexanderten5497]

i did not understand anything here

[@Debianguy31]

There are many prerequisites like OOps,Generics, functions 😅

[@shankar7435]

​@@Debianguy31I would have been in his position had I not been fairly proficient in Java Generics. Now at least I do not get stuck reading that code. I understand every bit of the code but difficult to reproduce with the same ease when its required due to too many conditions to consider.

[@scottzeta3067]

removeAt is not correct, line 52 should be i++ instead of j--

[@劉宗旻-k9l]

Thank you! I was confusing for a long time until I saw your comment.

[@buihung3704]

You're wrong. If i++, you will be skipping an element which is rm_index + 1 right in that iteration, making new_arr lost that value, looks closely it's an if-else, not if + a line that always run on each iteration :v

[@indranishome9003]

What ide is this ?

[@buihung3704]

Wtf is wrong with this code? In removeAt(), you didn't consider the AND condition on line 48? How about rm_index = 0 and len = 1, how are u gonna initialize a static array with 0 space on line 50? P.s: Okay i understand the capacity reset, since this is a new array not the old array anymore, the new array have been placed on different memory pointer than the old one. Old capacity don't mean shjt after changing array. So why don't we make the capacity x2 the length after call removeAt()? Well this is what I called uncertainty, u don't know what u gonna do next right? Wait until u call add() method again and then u can allocate more capacity. P.s 2: I study the continuous mechanism of array in memory context :3

[@patricksile]

Everything was nice till I saw your examples were in `Java`. :smile:

[@ayeshabashir5785]

same!

[@alaetouba9049]

haha whats wrong with java?

[@alizafari8729]

Python and C++ implementations could be found here: github.com/akzare/Algorithms

[@SantoshKumar-lz2ti]

why java??? why not c++🥲

[@mikaeltofvesson1882]

public T remove(int idx){ T removeItem = theItems[idx]; for(int i = idx; i < size()-1; i++ ){ theItems[i] = theItems[i+1]; } theSize--; return removeItem; }