http://www.jsoftware.com/jwiki/Essays/DataStructures
2013/2/16 Y-01 <[email protected]> > hi@all > > I have some basic questions on which i can't find any answers > > 1. How we can create a linked list with push_back complexity =~ O(1) in J ? > we need to save a poinet to last element > > 2. is it right that these examples correspond to linked lists? > > 1;<2 > 1;<(2;<3) > 1;<(2;<(3;<4)) > > 3. And what about hashmap? Is it right that there is no any builtined > hashmap struct? Maybe there is a popular aside addon/lib (smth like > hash.ijs) ? > ---------------------------------------------------------------------- > For information about J forums see http://www.jsoftware.com/forums.htm > -- Björn Helgason, Verkfræðingur Fornustekkum II 781 Hornafirði, t-póst: [email protected] gsm: +3546985532 twitter: @flugfiskur http://groups.google.com/group/J-Programming Tæknikunnátta höndlar hið flókna, sköpunargáfa er meistari einfaldleikans góður kennari getur stigið á tær án þess að glansinn fari af skónum /|_ .-----------------------------------. ,' .\ / | Með léttri lund verður | ,--' _,' | Dagurinn í dag | / / | Enn betri en gærdagurinn | ( -. | `-----------------------------------' | ) | (\_ _/) (`-. '--.) (='.'=) ♖♘♗♕♔♙ `. )----' (")_(") ☃☠ ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
