Skip to content
#

User experience (UX)

User experience (UX) goes beyond just UI and its design—it's more about the anticipation of the needs of the user and solutions that fit them.

Here are 74 public repositories matching this topic...

AVL Tree is a self-balancing binary search tree where the height difference of the left and right subtrees can't exceed 1. It's named after Adelson-Velsky and Landis and provides efficient search, insert, and delete operations with O(log n) time complexity, making it a reliable choice for large data sets.

  • Updated Feb 7, 2023
  • Kotlin

Approximation algorithms are algorithms that find approximate solutions to optimization problems, usually with a guarantee of the solution's quality relative to the optimal solution. They are used when exact solutions are too time-consuming to compute. Approximation algorithms trade-off optimality for efficiency and are commonly used in scheduling.

  • Updated Feb 9, 2023
  • Kotlin