Hi everyone! My name is Spiros Maggioros and i'm a 3rd year undegraduate
electrical & computer engineering student at National Technical University
of Athens.I've worked as a machine learning engineering intern at OTE(HTO),
i'm the lead of IEEEXtreme for the Greek section and a Computer Lab
Ass
On Wed, 17 Jan 2024 at 15:16, Spiros Maggioros wrote:
>
> Hi everyone!
Hi Spiros,
> My name is Spiros Maggioros and i'm a 3rd year undegraduate electrical &
> computer engineering student at National Technical University of Athens.I've
> worked as a machine learning engineering intern at OTE(H
I accidentally made a mistake while explaining, in the photo with the AVL
tree, the polynomial represented is P(x) = Cx^3 + Bx^2 + Ax, the {+0, +1,
+2} tags are the heights for each node for the rotation.Sorry about that.
Στις Τετάρτη 17 Ιανουαρίου 2024 στις 5:54:55 μ.μ. UTC+2, ο χρήστης Spiros
On Wed, 17 Jan 2024 at 15:54, Spiros Maggioros
wrote:
> So we showed that, using AVL trees instead of arrays is much better(note
> that even linked lists is slower cause the insertion time complexity is
> O(n)).
>
Interesting. Did you compare the AVL tree with other sparse data structures?
> I
I understand, hash-table(unordered_map in c++) is the only data structures
that beats the tree representation in c++, there's drawbacks though, as you
mentioned, and one more drawback is that you can't really sort the
polynomial using this data structure, cause it's a "1-1" function, the only
w
