<?xml version="1.0"?>
<rss version="2.0">
   <channel>
      <title>Shell Sort by Geovane Filho</title>
      <link>https://padlet.com/geovane2002/p8iz5gz15amhkjx7</link>
      <description>Um mural com informações sobre o algoritmo Shell Sort.</description>
      <language>en-us</language>
      <pubDate>2022-01-12 14:32:16 UTC</pubDate>
      <lastBuildDate>2023-01-23 20:54:11 UTC</lastBuildDate>
      <webMaster>hello@padlet.com</webMaster>
      <image>
         <url>https://padlet.net/icons/png/1f4be.png</url>
      </image>
      <item>
         <title>Shell Sort no GeeksForGeeks</title>
         <author>geovane2002</author>
         <link>https://padlet.com/geovane2002/p8iz5gz15amhkjx7/wish/1988359517</link>
         <description><![CDATA[<div>Uma explicação sobre o funcionamento do algoritmo feita pelo site GeeksForGeeks.</div>]]></description>
         <enclosure url="https://www.geeksforgeeks.org/shellsort/" />
         <pubDate>2022-01-12 14:40:29 UTC</pubDate>
         <guid>https://padlet.com/geovane2002/p8iz5gz15amhkjx7/wish/1988359517</guid>
      </item>
      <item>
         <title>Funcionamento do Shell Sort usando copos</title>
         <author>geovane2002</author>
         <link>https://padlet.com/geovane2002/p8iz5gz15amhkjx7/wish/1988366108</link>
         <description><![CDATA[]]></description>
         <enclosure url="https://youtu.be/M3bS6w1R434" />
         <pubDate>2022-01-12 14:43:02 UTC</pubDate>
         <guid>https://padlet.com/geovane2002/p8iz5gz15amhkjx7/wish/1988366108</guid>
      </item>
      <item>
         <title>Exemplo de quando o tamanho do array é ímpar</title>
         <author>geovane2002</author>
         <link>https://padlet.com/geovane2002/p8iz5gz15amhkjx7/wish/1988379177</link>
         <description><![CDATA[]]></description>
         <enclosure url="https://youtu.be/ddeLSDsYVp8" />
         <pubDate>2022-01-12 14:48:35 UTC</pubDate>
         <guid>https://padlet.com/geovane2002/p8iz5gz15amhkjx7/wish/1988379177</guid>
      </item>
      <item>
         <title>Comportamento do algoritmo</title>
         <author>geovane2002</author>
         <link>https://padlet.com/geovane2002/p8iz5gz15amhkjx7/wish/1988389774</link>
         <description><![CDATA[<div><br>- Comparamos elementos que estão a uma distância em vez de adjacentes;<br><br>- Para isso calculamos uma "abertura" para cada passagem e, em seguida, selecionamos os elementos à direita dessa abertura;<br><br>- Neste caso, reduzimos a abertura dividindo-o por 2;<br><br>- Realizamos essas ações de comparar e depois dividir até que o array esteja ordenado.</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-01-12 14:52:53 UTC</pubDate>
         <guid>https://padlet.com/geovane2002/p8iz5gz15amhkjx7/wish/1988389774</guid>
      </item>
      <item>
         <title>Funcionamento do algoritmo explicado com dança </title>
         <author>geovane2002</author>
         <link>https://padlet.com/geovane2002/p8iz5gz15amhkjx7/wish/1988410619</link>
         <description><![CDATA[]]></description>
         <enclosure url="https://youtu.be/CmPA7zE8mx0" />
         <pubDate>2022-01-12 15:01:06 UTC</pubDate>
         <guid>https://padlet.com/geovane2002/p8iz5gz15amhkjx7/wish/1988410619</guid>
      </item>
      <item>
         <title>Análise da complexidade do algoritmo ShellSort</title>
         <author>geovane2002</author>
         <link>https://padlet.com/geovane2002/p8iz5gz15amhkjx7/wish/1988444945</link>
         <description><![CDATA[]]></description>
         <enclosure url="https://youtu.be/_7DZtIAG4xo" />
         <pubDate>2022-01-12 15:15:32 UTC</pubDate>
         <guid>https://padlet.com/geovane2002/p8iz5gz15amhkjx7/wish/1988444945</guid>
      </item>
      <item>
         <title>Surgimento do Algoritmo</title>
         <author>geovane2002</author>
         <link>https://padlet.com/geovane2002/p8iz5gz15amhkjx7/wish/1988471265</link>
         <description><![CDATA[<div>- Criado por Donald Shell;<br>- Surgiu no mês de julho de 1959;<br>- Publicado pela Universidade de Cincinnati (EUA - Ohio);<br>- Donald Shell também foi responsável por estudar sobre a convergência de exponenciais infinitos.<br><br>Fonte: https://en.wikipedia.org/wiki/Donald_Shell<br><br></div>]]></description>
         <enclosure url="https://padlet-uploads.storage.googleapis.com/1534173263/2f1cd65919729530dde00197f5701491/DonShell_1.jpg" />
         <pubDate>2022-01-12 15:26:08 UTC</pubDate>
         <guid>https://padlet.com/geovane2002/p8iz5gz15amhkjx7/wish/1988471265</guid>
      </item>
      <item>
         <title>Um pouco sobre o algoritmo e a sua implementação em diferentes linguagens</title>
         <author>geovane2002</author>
         <link>https://padlet.com/geovane2002/p8iz5gz15amhkjx7/wish/1988478819</link>
         <description><![CDATA[]]></description>
         <enclosure url="https://pt.wikipedia.org/wiki/Shell_sort" />
         <pubDate>2022-01-12 15:29:13 UTC</pubDate>
         <guid>https://padlet.com/geovane2002/p8iz5gz15amhkjx7/wish/1988478819</guid>
      </item>
      <item>
         <title>Análise de uma versão modificada do Shell Sort para Encriptação homomórfica - Artigo IEEE</title>
         <author>marcossouza8</author>
         <link>https://padlet.com/geovane2002/p8iz5gz15amhkjx7/wish/1989275120</link>
         <description><![CDATA[]]></description>
         <enclosure url="https://ieeexplore.ieee.org/document/9530524" />
         <pubDate>2022-01-12 23:38:59 UTC</pubDate>
         <guid>https://padlet.com/geovane2002/p8iz5gz15amhkjx7/wish/1989275120</guid>
      </item>
      <item>
         <title>Shell Sort - Funcionamento</title>
         <author>marcossouza8</author>
         <link>https://padlet.com/geovane2002/p8iz5gz15amhkjx7/wish/1989281692</link>
         <description><![CDATA[<div>Este vídeo é para ajudar na compreensão do algoritmo de ordenação Shell Sort.</div>]]></description>
         <enclosure url="https://www.youtube.com/watch?v=U_a0R_IbjSM" />
         <pubDate>2022-01-12 23:46:41 UTC</pubDate>
         <guid>https://padlet.com/geovane2002/p8iz5gz15amhkjx7/wish/1989281692</guid>
      </item>
      <item>
         <title>Comparando algoritmos de ordenação - Feito pelo grupo</title>
         <author>geovane2002</author>
         <link>https://padlet.com/geovane2002/p8iz5gz15amhkjx7/wish/1990674630</link>
         <description><![CDATA[]]></description>
         <enclosure url="https://colab.research.google.com/drive/1aMNuSLK0RotiESd9f5JBeI773hincnE_?usp=sharing" />
         <pubDate>2022-01-13 15:57:37 UTC</pubDate>
         <guid>https://padlet.com/geovane2002/p8iz5gz15amhkjx7/wish/1990674630</guid>
      </item>
      <item>
         <title>Veja a comparação do Shell Sort com alguns algoritmos de ordenação</title>
         <author>geovane2002</author>
         <link>https://padlet.com/geovane2002/p8iz5gz15amhkjx7/wish/1993104290</link>
         <description><![CDATA[]]></description>
         <enclosure url="https://www.toptal.com/developers/sorting-algorithms" />
         <pubDate>2022-01-14 22:32:34 UTC</pubDate>
         <guid>https://padlet.com/geovane2002/p8iz5gz15amhkjx7/wish/1993104290</guid>
      </item>
      <item>
         <title>Análise empírica do Shell Sort -  Artigo brasileiro publicado no I Encontro de Teoria da Computação </title>
         <author>geovane2002</author>
         <link>https://padlet.com/geovane2002/p8iz5gz15amhkjx7/wish/1993138087</link>
         <description><![CDATA[]]></description>
         <enclosure url="https://sol.sbc.org.br/index.php/etc/article/view/9856" />
         <pubDate>2022-01-14 23:41:02 UTC</pubDate>
         <guid>https://padlet.com/geovane2002/p8iz5gz15amhkjx7/wish/1993138087</guid>
      </item>
      <item>
         <title>Veja mais artigos relacionados a ShellSort na plataforma da IEEE</title>
         <author>geovane2002</author>
         <link>https://padlet.com/geovane2002/p8iz5gz15amhkjx7/wish/1993140887</link>
         <description><![CDATA[]]></description>
         <enclosure url="https://ieeexplore.ieee.org/search/searchresult.jsp?newsearch=true&amp;queryText=Shell%20Sort" />
         <pubDate>2022-01-14 23:46:15 UTC</pubDate>
         <guid>https://padlet.com/geovane2002/p8iz5gz15amhkjx7/wish/1993140887</guid>
      </item>
      <item>
         <title>Resultado do algoritmo feito pelo grupo</title>
         <author>geovane2002</author>
         <link>https://padlet.com/geovane2002/p8iz5gz15amhkjx7/wish/1993154464</link>
         <description><![CDATA[]]></description>
         <enclosure url="https://padlet-uploads.storage.googleapis.com/1534173263/2bbac0b50a1baf7e1e32dbee5ba01c40/download.png" />
         <pubDate>2022-01-15 00:17:54 UTC</pubDate>
         <guid>https://padlet.com/geovane2002/p8iz5gz15amhkjx7/wish/1993154464</guid>
      </item>
      <item>
         <title>Configurações da máquina utilizada:</title>
         <author>geovane2002</author>
         <link>https://padlet.com/geovane2002/p8iz5gz15amhkjx7/wish/1993156476</link>
         <description><![CDATA[<div>Foi utilizada a plataforma da Google para realizar os testes, ela possui as seguintes especificações:<br><br>- Intel(R) Xeon(R) CPU @ 2.20GHz<br>- 13GB RAM</div><div>- 33GB de espaço livre<br>- Interrupção ociosa 90 minutos<br>- Máximo de 12 horas<br><br>fonte: https://www.ti-enxame.com/pt/hardware/qual-e-especificacao-de-hardware-do-google-colaboratory/835071994/<br><br>fonte2: https://colab.research.google.com/drive/1dint4ly-7h8Trw0XRJ1uhC_VKe_wDJfY#scrollTo=0BEnwM-W23Y4</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-01-15 00:22:48 UTC</pubDate>
         <guid>https://padlet.com/geovane2002/p8iz5gz15amhkjx7/wish/1993156476</guid>
      </item>
      <item>
         <title>Complexidade</title>
         <author>geovane2002</author>
         <link>https://padlet.com/geovane2002/p8iz5gz15amhkjx7/wish/1994662595</link>
         <description><![CDATA[<div>Fonte: https://pt.wikipedia.org/wiki/Shell_sort</div>]]></description>
         <enclosure url="https://padlet-uploads.storage.googleapis.com/1534173263/ee34b25aa911ceccd98376e4ebcf75fc/image.png" />
         <pubDate>2022-01-16 20:15:07 UTC</pubDate>
         <guid>https://padlet.com/geovane2002/p8iz5gz15amhkjx7/wish/1994662595</guid>
      </item>
   </channel>
</rss>
