Jump to content

Orion Greymoon

Resident
  • Posts

    2
  • Joined

  • Last visited

Posts posted by Orion Greymoon

  1. On 10/24/2021 at 12:28 AM, Mollymews said:

    i looked it up, because I am nosey

    from the Fortran examples I found, seems a sparse array is a n-dimensional matrix with memory only taken up by used elements

    LSL equivalent is as you say lists within lists. Like:

    list a =
    [
      0,
      [1,[3,[7,8],4,[9,a]]],
      [2,[5,[b,c],6,[d,e]]]        
    ];

    i thought it was more like a tree because 'list a' is a binary tree. But I can see now that a tree is only a subset view of a n-dimensional sparse matrix

    i did read also that Fortran has quite a lot of helper functions/methods to quickly address/traverse the sparse array

    a answer on stackoverflow, was the most helpful in my understanding of this

    https://stackoverflow.com/questions/62255387/sparse-array-in-fortran

    Fortran sparse arrays are pretty cool. And I can see how extremely useful they are to engineers and scientists who have heaps of variable data to model

    Wow, that gave me a flashback to the "good old days" of Lisp...and not really a good one.  :)

     

    "( i am a list) (a ( a b c) d e fgh) (father tom ( susan bill joe)) (sun mon tue wed thur fri sat) ( )"

    • Like 1
×
×
  • Create New...