Question

What would be the algorithm to remove something from an array of things?

Answer 1

you iterate over each item
adding each element to a temp array except the element you wish to remove (elementIndex -1)
then just make the original reflect the changes of the temp array

Answer 2

what language? do you want it to be returned or just removed? will u replace the spot with a null object or a zero value or something else or just move everything else after one place?

Answer 3

if an element id removed from an array of size 1xN,
you get a new array of size 1x(N-1)

say we want to remove k^th element

step 1) create a new array of size 1x(N-1)
step 2) copy all contents from 1 to (k-1 ) from original array to the new array
step 3) copy all contents from (k+1) to N from original array to the new array

the new array is now the original array without the k^th element.

Answer 4

correct me if i am wrong.
arrays are not re-sizable so if u delete/ remove an item from it u get a null object at its place.
so or as @electrokid says u "play" with 2 arrays , or u use something else that is re-sizable.
ex. ArrayList or something else.

Answer 5

yeah I know you have to use two arrays. With arraylists its easier because they have a remove method.

Answer 6

in object oriented programming, using classes, like "vector class" in C++, you can modify the array.

Answer 7

i believe this is java though..or am i wrong?

Answer 8

yes its java

Answer 9

but you can do this in other languages too

Answer 10

@akhaliq99 I see you are creating a doxygen manual for this ;)

Answer 11

ofc u can :)

Answer 12

right I think its called javadoc in java

Answer 13

it does in the first for loop

Answer 14

saw that

Answer 15

why do you need two loops though.. you can do the same in one loop

Answer 16

sounds about right then