{"id":3230,"date":"2022-06-29T22:52:10","date_gmt":"2022-06-29T19:52:10","guid":{"rendered":"https:\/\/demensdeum.com\/blog\/?p=3230"},"modified":"2024-12-16T22:32:19","modified_gmt":"2024-12-16T19:32:19","slug":"sleep-sort","status":"publish","type":"post","link":"https:\/\/demensdeum.com\/blog\/pt\/2022\/06\/29\/sleep-sort\/","title":{"rendered":"Classifica\u00e7\u00e3o do sono"},"content":{"rendered":"

Classifica\u00e7\u00e3o do sono – sleep sort, outro representante de algoritmos determin\u00edsticos de classifica\u00e7\u00e3o estranha.<\/p>\n

Funciona assim:<\/p>\n

    \n
  1. Percorre uma lista de elementos<\/li>\n
  2. Um thread separado \u00e9 lan\u00e7ado para cada loop<\/li>\n
  3. O thread fica suspenso por um per\u00edodo de tempo – valor do elemento e sa\u00edda do valor ap\u00f3s dormir<\/li>\n
  4. No final do loop, aguarde a conclus\u00e3o do sono mais longo do thread e exiba a lista classificada<\/li>\n<\/ol>\n

    Exemplo de c\u00f3digo para algoritmo de classifica\u00e7\u00e3o de sono em C:<\/p>\n

    \n
    #include <stdlib.h>\n#include <pthread.h>\n#include <unistd.h>\n\ntypedef struct {\n    int number;\n} ThreadPayload;\n\nvoid *sortNumber(void *args) {\n    ThreadPayload *payload = (ThreadPayload*) args;\n    const int number = payload->number;\n    free(payload);\n    usleep(number * 1000);\n    printf(\"%d \", number);\n    return NULL;\n}\n\nint main(int argc, char *argv[]) {\n    const int numbers[] = {2, 42, 1, 87, 7, 9, 5, 35};\n    const int length = sizeof(numbers) \/ sizeof(int);\n\n    int maximal = 0;\n    pthread_t maximalThreadID;\n\n    printf(\"Sorting: \");\n    for (int i = 0; i < length; i++) { pthread_t threadID; int number = numbers[i]; printf(\"%d \", number); ThreadPayload *payload = malloc(sizeof(ThreadPayload)); payload->number = number;\n        pthread_create(&threadID, NULL, sortNumber, (void *) payload);\n        if (maximal < number) {\n            maximal = number;\n            maximalThreadID = threadID;\n        }\n    }\n    printf(\"\\n\");\n    printf(\"Sorted: \");\n    pthread_join(maximalThreadID, NULL);\n    printf(\"\\n\");\n    return 0;\n}\n<\/code><\/pre>\n<\/div>\n
    Nesta implementa\u00e7\u00e3o usei a fun\u00e7\u00e3o usleep em microssegundos com o valor multiplicado por 1000, ou seja, em milissegundos.
    Complexidade de tempo do algoritmo – O(muito longo)<\/strong><\/p>\n
    Links<\/h3>\n
    https:\/\/gitlab.com\/demensdeum \/algoritmos\/-\/tree\/master\/sortAlgorithms\/sleepSort<\/a><\/p>\n
    Fontes<\/h3>\n
    https:\/\/codoholicconfessions.wordpress. com\/2017\/05\/21\/algoritmos de classifica\u00e7\u00e3o mais estranhos\/<\/a>
    https:\/\/twitter.com\/javascriptdaily\/status\/856267407106682880?lang=en<\/a>
    \n    https:\/\/stackoverflow.com\/questions\/6474318\/what-is-the-time-complexity-of-the-sleep-sort<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"
    Classifica\u00e7\u00e3o do sono – sleep sort, outro representante de algoritmos determin\u00edsticos de classifica\u00e7\u00e3o estranha. Funciona assim: Percorre uma lista de elementos Um thread separado \u00e9 lan\u00e7ado para cada loop O thread fica suspenso por um per\u00edodo de tempo – valor do elemento e sa\u00edda do valor ap\u00f3s dormir No final do loop, aguarde a conclus\u00e3oContinue reading “Classifica\u00e7\u00e3o do sono”<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_monsterinsights_skip_tracking":false,"_monsterinsights_sitenote_active":false,"_monsterinsights_sitenote_note":"","_monsterinsights_sitenote_category":0,"_jetpack_memberships_contains_paid_content":false,"footnotes":""},"categories":[61,52],"tags":[131,194,190],"class_list":["post-3230","post","type-post","status-publish","format-standard","hentry","category-techie","category-tutorials","tag-algorithms","tag-sleep-sort","tag-sorting","entry"],"translation":{"provider":"WPGlobus","version":"3.0.2","language":"pt","enabled_languages":["en","ru","zh","de","fr","ja","pt"],"languages":{"en":{"title":true,"content":true,"excerpt":false},"ru":{"title":true,"content":true,"excerpt":false},"zh":{"title":true,"content":true,"excerpt":false},"de":{"title":true,"content":true,"excerpt":false},"fr":{"title":true,"content":true,"excerpt":false},"ja":{"title":true,"content":true,"excerpt":false},"pt":{"title":true,"content":true,"excerpt":false}}},"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/demensdeum.com\/blog\/pt\/wp-json\/wp\/v2\/posts\/3230","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/demensdeum.com\/blog\/pt\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/demensdeum.com\/blog\/pt\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/demensdeum.com\/blog\/pt\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/demensdeum.com\/blog\/pt\/wp-json\/wp\/v2\/comments?post=3230"}],"version-history":[{"count":10,"href":"https:\/\/demensdeum.com\/blog\/pt\/wp-json\/wp\/v2\/posts\/3230\/revisions"}],"predecessor-version":[{"id":3876,"href":"https:\/\/demensdeum.com\/blog\/pt\/wp-json\/wp\/v2\/posts\/3230\/revisions\/3876"}],"wp:attachment":[{"href":"https:\/\/demensdeum.com\/blog\/pt\/wp-json\/wp\/v2\/media?parent=3230"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/demensdeum.com\/blog\/pt\/wp-json\/wp\/v2\/categories?post=3230"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/demensdeum.com\/blog\/pt\/wp-json\/wp\/v2\/tags?post=3230"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}