[erlang-questions] re moving nth element from a list

[Nick Gerakines]

There might be a better way to do it, but this is what I use:

-module(remelem).
-compile(export_all).

remove_element(1, List) ->
    [_ | TheRest] = List, TheRest;
remove_element(ElemPos, List) when length(List) == ElemPos ->
    [_ | TheRest] = lists:reverse(List), lists:reverse(TheRest);
remove_element(ElemPos, List) ->
    {ListA, ListB} = lists:split(ElemPos - 1, List),
    [_, ElemB | ListC] = ListB,
    ListResB = [ElemB | ListC],
    ListA ++ ListResB.

# Nick Gerakines

On Tue, Jun 24, 2008 at 7:51 AM, Jesper Louis Andersen
<jesper.louis.andersen@REDACTED> wrote:
> On Tue, Jun 24, 2008 at 4:40 PM, anupamk <anupam.kapoor@REDACTED> wrote:
>>
>> hi all,
>>
>> can you please let me know what would be a more efficient approach to
>> removing nth element from a list.
>
> If your list is rather small, say N < 20, then I would suggest you use
> something along the
> lines of your first implementation. If your list is extremely big and
> performance matters, then
> I suggest you look for another data structure. With a list there is
> only so much you can do: You
> have to dig into the list in order to get to the Nth element and that
> will cost you O(n).
> _______________________________________________
> erlang-questions mailing list
> erlang-questions@REDACTED
> http://www.erlang.org/mailman/listinfo/erlang-questions
>