Before you keep reading...
Runestone Academy can only continue if we get support from individuals like you. As a student you are well aware of the high cost of textbooks. Our mission is to provide great books to you for free, but we ask that you consider a $10 donation, more if you can or less if $10 is a burden.
Before you keep reading...
Making great stuff takes time and $$. If you appreciate the book you are reading now and want to keep quality materials free for other students please consider a donation to Runestone Academy. We ask that you consider a $10 donation, but if you can give more thats great, if $10 is too much for your budget we would be happy with whatever you can afford as a show of support.
2.11. Ejercicios de programación
Invente un experimento para verificar que el operador index para listas es \(O(1)\)
Invente un experimento para verificar que las operaciones de obtención y asignación de ítems para diccionarios son \(O(1)\).
Invente un experimento que compare el desempeño del operador del en listas y en diccionarios.
Dada una lista de números en orden aleatorio, escriba un algoritmo que funcione en tiempo \(O(n\log(n))\) para encontrar el k-ésimo número más pequeño de la lista.
¿Puede usted mejorar el algoritmo del problema anterior para que sea lineal? Explique.
You have attempted
of
activities on this page
