<?xml version="1.0" encoding="UTF-8"?><rss xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:atom="http://www.w3.org/2005/Atom" version="2.0"><channel><title><![CDATA[RSS Feed]]></title><description><![CDATA[RSS Feed]]></description><link>http://direct.ecency.com</link><image><url>http://direct.ecency.com/logo512.png</url><title>RSS Feed</title><link>http://direct.ecency.com</link></image><generator>RSS for Node</generator><lastBuildDate>Thu, 16 Apr 2026 03:38:58 GMT</lastBuildDate><atom:link href="http://direct.ecency.com/created/recursive/rss.xml" rel="self" type="application/rss+xml"/><item><title><![CDATA[lloyddavis was heard to say at 2019/02/05 11:49:38]]></title><description><![CDATA[This is the state that my Twitter is at today as the Year of the Earth Pig begins. But you know this if you're looking at Twitter. #meta #recursive #share2steem Lloyd Davis Posted from Twitter via Share2Steem]]></description><link>http://direct.ecency.com/meta/@lloyd-social/lloyd-social-1549363778345-lloyddavis-was-heard-to-say-at-20190205-114938</link><guid isPermaLink="true">http://direct.ecency.com/meta/@lloyd-social/lloyd-social-1549363778345-lloyddavis-was-heard-to-say-at-20190205-114938</guid><category><![CDATA[meta]]></category><dc:creator><![CDATA[lloyd-social]]></dc:creator><pubDate>Tue, 05 Feb 2019 10:49:39 GMT</pubDate><enclosure url="https://images.ecency.com/p/sML2JBPsdAyMUJWzxvYnDYtKNvrTaMv1eeo9E5PZipEzPbddx3Kj8EB1jfqJLCwQ?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[Golang编程——使用递归解决迷宫问题。]]></title><description><![CDATA[递归（recursive) 迷宫问题(回溯) 递归的概念： 简单的说：递归就是函数/方法自己调用自己，每次调用时传入不同的变量。 递归有助于编程者解决复杂的问题，同时可以让代码变得简洁； package main import ( "fmt" ) func test(n int) { if n > 2 { n-- test(n) } fmt.Println("n=",]]></description><link>http://direct.ecency.com/cn/@sslinux/5wzlkv-golang</link><guid isPermaLink="true">http://direct.ecency.com/cn/@sslinux/5wzlkv-golang</guid><category><![CDATA[cn]]></category><dc:creator><![CDATA[sslinux]]></dc:creator><pubDate>Tue, 01 Jan 2019 17:50:54 GMT</pubDate></item><item><title><![CDATA[Recursive programs and recursive algorithms part 2]]></title><description><![CDATA[Recursive program Soon, we learned to write the equations and find out the value of recursive function in these two types of recursion trees. Now let's see how a computer program can be done by doing the]]></description><link>http://direct.ecency.com/busy/@knowledgeup/recursive-programs-and-recursive-algorithms-part-2</link><guid isPermaLink="true">http://direct.ecency.com/busy/@knowledgeup/recursive-programs-and-recursive-algorithms-part-2</guid><category><![CDATA[busy]]></category><dc:creator><![CDATA[knowledgeup]]></dc:creator><pubDate>Wed, 18 Apr 2018 15:39:36 GMT</pubDate><enclosure url="https://images.ecency.com/p/3HaJVw3AYyXBD5Md5tUD9YKkzGo1eoR2RP1hYxRaFr2DvFSBJDqx8LpgG4ifkrfHx8fJqBd5CgH4d8r9wrqgnKeroxapYG76yuUkfjw?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[Recursive programs and recursive algorithms part 1]]></title><description><![CDATA[A seminar is going to start. You're sitting in the audience rows. If the whole thing is til and noheer condition. But the speech did not start yet. Suddenly curiosity is to know how many rows in your seat]]></description><link>http://direct.ecency.com/computer/@knowledgeup/recursive-programs-and-recursive-algorithms-part-1</link><guid isPermaLink="true">http://direct.ecency.com/computer/@knowledgeup/recursive-programs-and-recursive-algorithms-part-1</guid><category><![CDATA[computer]]></category><dc:creator><![CDATA[knowledgeup]]></dc:creator><pubDate>Mon, 16 Apr 2018 16:48:24 GMT</pubDate><enclosure url="https://images.ecency.com/p/3HaJVw3AYyXBD5Md5tUD9YKkzGo1eoR2RP1hYxRaFr2DBkL33yBaLJP3npmawJEs36GhqURf6c3gR7dfyi8gUKsHFvpLxipF19VQ4Vm?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[All started with Bayes]]></title><description><![CDATA[A very simple conditional probability calculation formula is modern foundation of mobile robotic perception, sensor fusion and object tracking. If you need to deal with an 'uncertain world', you must resort]]></description><link>http://direct.ecency.com/bayes/@mrfairdeal/all-started-with-bayes</link><guid isPermaLink="true">http://direct.ecency.com/bayes/@mrfairdeal/all-started-with-bayes</guid><category><![CDATA[bayes]]></category><dc:creator><![CDATA[mrfairdeal]]></dc:creator><pubDate>Sat, 17 Feb 2018 08:53:27 GMT</pubDate></item><item><title><![CDATA[Dealing with long words in headers - a recursive approach]]></title><description><![CDATA[Using long words in headers is usually no problem on websites, but when it comes to mobile views it can become one. I stumbled over this problem in one of my projects: The shown content comes from a content]]></description><link>http://direct.ecency.com/javascript/@goodland/dealing-with-long-words-in-headers-a-recursive-approach</link><guid isPermaLink="true">http://direct.ecency.com/javascript/@goodland/dealing-with-long-words-in-headers-a-recursive-approach</guid><category><![CDATA[javascript]]></category><dc:creator><![CDATA[goodland]]></dc:creator><pubDate>Tue, 06 Feb 2018 10:33:09 GMT</pubDate><enclosure url="https://images.ecency.com/p/Zskj9C56UondJxcjVaienfhVaNb7LJVWG6e787gZyuUq8VYquzY5tSJprEdVknFxj5zXCLMakDq665aCQwWaCDw1WQF8Ej6sK5bP9cHrYefc6rUSEgjp?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[读书笔记：《算法图解》第三章 递归]]></title><description><![CDATA[定义： 在数学与计算机科学中，是指在函数的定义中使用函数自身的方法。递归一词还较常用于描述以自相似方法重复事物的过程。例如，当两面镜子相互之间近似平行时，镜中嵌套的图像是以无限递归的形式出现的。也可以理解为自我复制的过程。 例子：]]></description><link>http://direct.ecency.com/cn/@sunsi/epyqx</link><guid isPermaLink="true">http://direct.ecency.com/cn/@sunsi/epyqx</guid><category><![CDATA[cn]]></category><dc:creator><![CDATA[sunsi]]></dc:creator><pubDate>Mon, 15 Jan 2018 06:25:18 GMT</pubDate></item><item><title><![CDATA[Is this working anymore]]></title><description><![CDATA[Did someone change the blockchain without anyone noticing, this used to work, something smells wrong]]></description><link>http://direct.ecency.com/recursive/@k-rapper/is-this-working-anymore</link><guid isPermaLink="true">http://direct.ecency.com/recursive/@k-rapper/is-this-working-anymore</guid><category><![CDATA[recursive]]></category><dc:creator><![CDATA[k-rapper]]></dc:creator><pubDate>Sun, 24 Sep 2017 16:53:03 GMT</pubDate></item><item><title><![CDATA[Recursive Upvoting]]></title><description><![CDATA[I dont think there is a limit...odd]]></description><link>http://direct.ecency.com/recursive/@k-rapper/recursive-upvoting</link><guid isPermaLink="true">http://direct.ecency.com/recursive/@k-rapper/recursive-upvoting</guid><category><![CDATA[recursive]]></category><dc:creator><![CDATA[k-rapper]]></dc:creator><pubDate>Fri, 15 Sep 2017 15:07:36 GMT</pubDate></item><item><title><![CDATA[Programming - Assembly Stack and Recursive Algorithms]]></title><description><![CDATA[    Hello its'a me again! Today we will continue our talk with functions, but this time we will call functions inside of functions, storing the return address inside of a stack (to]]></description><link>http://direct.ecency.com/programming/@drifter1/programming-assembly-stack-and-recursive-algorithms</link><guid isPermaLink="true">http://direct.ecency.com/programming/@drifter1/programming-assembly-stack-and-recursive-algorithms</guid><category><![CDATA[programming]]></category><dc:creator><![CDATA[drifter1]]></dc:creator><pubDate>Tue, 22 Aug 2017 13:30:06 GMT</pubDate><enclosure url="https://images.ecency.com/p/2YRZBi4FZVHekBjEMpAUQQnjGHXxbWA2gUfosZ6nG2UUDqLkevmkkmWDAaPkEzfc26DzxjFUnTcEiRiVUX66n9TCggcrk7oa2ra?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[Programming - C Recursive Algorithms]]></title><description><![CDATA[   Until I upload the Java Exercise Solution we will be taking a look into C again. Today's post will be about Recursive Algorithms in C Language, but it will also work in mostly every language,]]></description><link>http://direct.ecency.com/programming/@drifter1/programming-c-recursive-algorithms</link><guid isPermaLink="true">http://direct.ecency.com/programming/@drifter1/programming-c-recursive-algorithms</guid><category><![CDATA[programming]]></category><dc:creator><![CDATA[drifter1]]></dc:creator><pubDate>Mon, 17 Jul 2017 14:28:45 GMT</pubDate><enclosure url="https://images.ecency.com/p/B69zEhWZA8UEAMn3PZ8F8VrRF6a8wsWryzqbgtLMpmDDDWmJxx5yGGHUcF5e1juwSyByBfwDhdJgbzkgQqeu7fZAsQ6RgMhjZpgGrgYE?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[Cyberia]]></title><description><![CDATA[No matter on what scale we observe fractals, an infinite amount of self similar copies will appear. Those fractals are guided in their revolution towards a certain point that we call attractor. Pumpkin]]></description><link>http://direct.ecency.com/art/@shankaraya/cyberia</link><guid isPermaLink="true">http://direct.ecency.com/art/@shankaraya/cyberia</guid><category><![CDATA[art]]></category><dc:creator><![CDATA[shankaraya]]></dc:creator><pubDate>Fri, 14 Jul 2017 23:24:39 GMT</pubDate><enclosure url="https://images.ecency.com/p/3W72119s5BjWPGGUiZ9pqnZoj8JHYxCCp9dtn2QVeZpDv7B5PKEVttLGs2aEW3SEWMsGFYPiz7iaZkXFdjiLCztHZjAGVtKgRafQTaCYDJ6vM9XhfJXXjj?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[Meme challenge #11 - Entry #1 - Trending]]></title><link>http://direct.ecency.com/memechallenge/@richardjuckes/meme-challenge-11-entry-1-trending</link><guid isPermaLink="true">http://direct.ecency.com/memechallenge/@richardjuckes/meme-challenge-11-entry-1-trending</guid><category><![CDATA[memechallenge]]></category><dc:creator><![CDATA[richardjuckes]]></dc:creator><pubDate>Tue, 04 Apr 2017 18:19:06 GMT</pubDate><enclosure url="https://images.ecency.com/p/3W72119s5BjWPGGUiZ9pqnZoj8JHYxCCp9dtn2QVg85SvNkJnTkqQy98nbspEJ4iEddsy1s61BYEUTGHkq5ownonUj21gFsAEne2qLoGGUYmtYgWXJyLG6?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[Easy Tutorial: Computer Programming for DUMMIES (recursion made simple!)]]></title><description><![CDATA[Hey guys, this is part 12 of my programming tutorials! This tutorial is in C++. If you want to catch up on any of my tutorials, here they are: Part 1: Hello World! Part 2: Variables Part 3: Functions Part]]></description><link>http://direct.ecency.com/programming/@charlie.wilson/easy-tutorial-computer-programming-for-dummies-recursion-made-simple</link><guid isPermaLink="true">http://direct.ecency.com/programming/@charlie.wilson/easy-tutorial-computer-programming-for-dummies-recursion-made-simple</guid><category><![CDATA[programming]]></category><dc:creator><![CDATA[charlie.wilson]]></dc:creator><pubDate>Sat, 01 Oct 2016 21:05:30 GMT</pubDate><enclosure url="https://images.ecency.com/p/4i88GgGXrYh4bjEZG7oX6fNBXXSGXHhDGRW6PJUoyzFCRGqF4XYMKQ2hkMLyZuv5kxemCv4p6JWKkZjb79eEBsiVvFpAX1WumXEAWWKXH2JJuGXLFmw55v3Hqg?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[This article is a lie - Recursive loops]]></title><description><![CDATA[The whole world, absolutely the the whole world can be classified into two groups. Now, read that sentence again and check out how "the" was repeated, and you didn't notice (Some, may even re-read everything]]></description><link>http://direct.ecency.com/science/@renzoarg/this-article-is-a-lie-recursive-loops</link><guid isPermaLink="true">http://direct.ecency.com/science/@renzoarg/this-article-is-a-lie-recursive-loops</guid><category><![CDATA[science]]></category><dc:creator><![CDATA[renzoarg]]></dc:creator><pubDate>Thu, 08 Sep 2016 22:32:39 GMT</pubDate><enclosure url="https://images.ecency.com/p/qjrE4yyfw5pNdBmn2m1yCFa7rvb6qpt33ATVzeRZVSveSkBpANzT71XeQo15DFrTxHsYh1TiQfL5K5SYEn3a5h94VR8DvNSzcKjY638CuhGJTFELGV8ZZ6NJ?format=match&amp;mode=fit" length="0" type="false"/></item></channel></rss>