{"action":"opened","issue":{"url":"https://api.github.com/repos/ae77em/tda22016-tp1/issues/2","repository_url":"https://api.github.com/repos/ae77em/tda22016-tp1","labels_url":"https://api.github.com/repos/ae77em/tda22016-tp1/issues/2/labels{/name}","comments_url":"https://api.github.com/repos/ae77em/tda22016-tp1/issues/2/comments","events_url":"https://api.github.com/repos/ae77em/tda22016-tp1/issues/2/events","html_url":"https://github.com/ae77em/tda22016-tp1/issues/2","id":180794544,"number":2,"title":"Ordenar y seleccionar","user":{"login":"ae77em","id":12264054,"avatar_url":"https://avatars.githubusercontent.com/u/12264054?v=3","gravatar_id":"","url":"https://api.github.com/users/ae77em","html_url":"https://github.com/ae77em","followers_url":"https://api.github.com/users/ae77em/followers","following_url":"https://api.github.com/users/ae77em/following{/other_user}","gists_url":"https://api.github.com/users/ae77em/gists{/gist_id}","starred_url":"https://api.github.com/users/ae77em/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/ae77em/subscriptions","organizations_url":"https://api.github.com/users/ae77em/orgs","repos_url":"https://api.github.com/users/ae77em/repos","events_url":"https://api.github.com/users/ae77em/events{/privacy}","received_events_url":"https://api.github.com/users/ae77em/received_events","type":"User","site_admin":false},"labels":[],"state":"open","locked":false,"assignee":null,"assignees":[],"milestone":null,"comments":0,"created_at":"2016-10-04T02:52:57Z","updated_at":"2016-10-04T02:52:57Z","closed_at":null,"body":"Ordena el conjunto mediante un algoritmo veloz de comparación y luego seleccionar el k elemento del arreglo ordenado.\r\n\r\n- [ ] Implementar todos los algoritmos propuestos.\r\n- [ ] Calcular analíticamente la complejidad de cada uno (excepto la de QuickSelect).\r\n- [ ] Mostrar conjuntos de 16 elementos con los mejores y peores casos de cada algoritmo.\r\n- [ ] Graficar los tiempos de ejecución para entradas aleatorias de tamaño representativo.\r\n- [ ] Analizar qué algoritmo es el óptimo para cada k según el tamaño de la entrada (n)."}}
{"actor":{"display_login":"ae77em"}}