adding Tree(s) sort(ed)

content/algoliterary-works/paseo-por-los-arboles.md

@@ -13,7 +13,7 @@ humans: Emilia Pardo Bazán
     Daniel Arribas Hedo
 language: Spanish
     English
-published: In development
+published: 2021
 license: <a href="https://gitlab.constantvzw.org/unbound/cc4r">Collective Conditions for (re-)use (CC4r), June 2021</a>
 publication_url: http://paseo-por-arboles.algoliterarypublishing.net
 repository: https://gitlab.constantvzw.org/anais_berck/paseo-por-arboles-de-madrid</a>

content/algoliterary-works/sorted-trees.md

@@ -0,0 +1,16 @@
+title: Levenshtein Distance
+algorithm: Levenshtein Distance
+trees: eucaliptus + found species in Spanish on the internet
+humans: Julio Cortázar
+    Gijs de Heij
+    An Mertens
+language: Spanish
+    English
+published: 2021
+license: <a href="https://gitlab.constantvzw.org/unbound/cc4r">Collective Conditions for (re-)use (CC4r), June 2021</a>
+repository: https://gitlab.constantvzw.org/anais_berck/levenshtein-distance-lee-a-cortazar
+publication_url: http://anaisberck.tabakalera.eus/
+support: This book is a creation for <a href="https://www.tabakalera.eus/es/agora-cemento-codigo">ÁGORA / CEMENT / CÓDIGO</a>, an online exhibition curated by <a href="https://www.tabakalera.eus/es/lekutan">Lekutan</a>, within the programme of Komisario Berriak supported by <a href="https://www.tabakalera.eus">Tabakalera</a> in Donostia/San Sebastián, Spain.
+thanks: Andrea Estankona, Jaime Munárriz, Esther Berdión
+
+The author of this book is the Levenhstein Distance algorithm, the subject is the eucalyptus tree in "Fama y eucalipto", an excerpt from Historias de Cronopios y de Famas by <a href="https://en.wikipedia.org/wiki/Julio_Cort%C3%A1zar">Julio Cortázar</a>, published in 1962 by Editorial Minotauro. <a href="https://en.wikipedia.org/wiki/Levenshtein_distance">Levenshtein distance</a>, edit distance or word distance is an algorithm that operates in spell checkers. It is the minimum number of operations required to transform one word into another. An operation can be an insertion, deletion or substitution of a character. The algorithm was an invention of Russian scientist Vladimir Levenshtein in 1965.

content/algoliterary-works/trees-sorted.md

@@ -0,0 +1,13 @@
+title: Tree(s) sort(ed)
+algorithm: Tree sort
+trees: beeches, oaks, maples, chestnuts in Bois de la Cambre/Ter Kameren Bos and Sonian Forest
+humans: 60 students of ESA Saint-Luc Bruxelles, Jara Rocha, Outi Laiti, Stephan Kampelmann, Nathalie Grandjean, Loren Ren Britton, Guillaume Slizewicz, Gijs de Heij, An Mertens.
+language: English
+published: 2022
+license: <a href="https://gitlab.constantvzw.org/unbound/cc4r">Collective Conditions for (re-)use (CC4r), June 2021</a>
+publication url: <a href="https://cloud.constantvzw.org/s/Wt5nBpyH6LLqWLa">Sorted by date</a>; <a href="https://cloud.constantvzw.org/s/pxiJkrBAjGn7DTx">Sorted by colour</a>; <a href="https://cloud.constantvzw.org/s/33XJw84Qn3t5zY8">Sorted by natural element</a>; <a href="https://cloud.constantvzw.org/s/JndqK7J78HCxKnX">Alt-text</a>
+repository: https://gitlab.constantvzw.org/anais_berck/trees-sorted
+support: These posters are a creation for the exhibition in the framework of the Open Door Days in <a href="">ESA Saint-Luc Bruxelles</a> with the support of <a href="https://www.frs-fnrs.be/fr/financements/credits-et-projets/frart">FRArt</a>.
+thanks: Danielle Lenaerts, Mark Streker
+
+The generator of this poster is the tree sort algorithm, the subject are all the trees, algorithmic exercises and human beings involved in the <a href="https://algoliterarypublishing.net/activities.html">residency of Anaïs Berck at the Villa Empain and ESA Saint-Luc Bruxelles</a> in October 2021. The images and texts are srted following different criteria: time, colour and the natural element in the alt-text description of the images. <a href="https://en.wikipedia.org/wiki/Tree_sort">Tree sort</a> or binary search tree allows for fast lookup, addition, and removal of data items, and can be used to implement dynamic sets and lookup tables. The basic operations include: search, traversal, insert and delete.They are used in relational databases, data compression code, in Unix kernels for managing a set of virtual memory areas, and more. The binary search tree algorithm was discovered independently by several researchers, including P.F. Windley, Andrew Donald Booth (UK), Andrew Colin (UK), Thomas N. Hibbard (US), and attributed to Conway Berners-Lee (UK) and David Wheeler (UK), in 1960 for storing labelled data in magnetic tapes.