dotnetomaniak.pl - Artykuły z tagiem algorithmsdotnetomaniak.pl - Artykuły z tagiem algorithms2024-03-28T20:35:21Zhttps://dotnetomaniak.pl/Tags/algorithmsCopyright (c) dotnetomaniak.pldotnetomaniak.pl Atom Generatordotnetomaniak.pl webmasteradmin@dotnetomaniak.plhttps://dotnetomaniak.pl/Assets/Images/fav.icohttps://dotnetomaniak.pl/Assets/Images/dotnetomaniak_logo-negatyw_small.png10025https://dotnetomaniak.pl/Matching-regexes-using-backtrackingMatching regexes using backtracking2020-07-05T16:21:25Z<div><div><div style="float:right"><img alt ="" src="http://dotnetomaniak.pl/Data/Thumbnails/small_XTGYRZUuOUKrdt1UQeIjfA.png"/></div><div>Zastanawiałeś się może kiedyś w jaki sposób biblioteki do wyrażeń regularnych wyszukują wzorce w teksie? Jeżeli tak to ten artykuł jest dla Ciebie. Uprzedzam kod w Javie, ale tym lepiej bo algorytm i tak warto napisać samemu żeby lepiej zrozumieć :D</div></div><div style="padding-top:4px"><a rev="vote-for" href="https://dotnetomaniak.pl/Matching-regexes-using-backtracking"><img alt="Podbij ↑" src="https://dotnetomaniak.pl/image.axd?url=https%3a%2f%2fmarcin-chwedczuk.github.io%2fmatching-regexes-using-backtracking" style="border:0px"/></a></div></div>asciiBladehttps://dotnetomaniak.pl/Users/quyZZh_L6U6TWaCY2Ix8Gw2020-07-06T06:33:26Zhttps://dotnetomaniak.pl/Matching-regexes-using-backtracking1660Zastanawiałeś się może kiedyś w jaki sposób biblioteki do wyrażeń regularnych wyszukują wzorce w teksie? Jeżeli tak to ten artykuł jest dla Ciebie. Uprzedzam kod w Javie, ale tym lepiej bo algorytm i tak warto napisać samemu żeby lepiej zrozumieć :Dhttps://marcin-chwedczuk.github.io/matching-regexes-using-backtrackinghttp://dotnetomaniak.pl/Data/Thumbnails/small_XTGYRZUuOUKrdt1UQeIjfA.pnghttps://dotnetomaniak.pl/Poisson-Regression-using-F-and-MLNET-bush_devPoisson Regression using F# and ML.NET | bush_dev2020-04-03T05:22:28Z<div><div><div style="float:right"><img alt ="" src="http://dotnetomaniak.pl/Data/Thumbnails/small_ppoLBM_cqUSI_RVooRkYVA.png"/></div><div>I wrote there about what this type of regression is and showed how it can be implemented in F # using the ML.NET library.</div></div><div style="padding-top:4px"><a rev="vote-for" href="https://dotnetomaniak.pl/Poisson-Regression-using-F-and-MLNET-bush_dev"><img alt="Podbij ↑" src="https://dotnetomaniak.pl/image.axd?url=http%3a%2f%2fbush-dev.com%2fpoisson-regression-using-f-sharp-and-ml-net%2f" style="border:0px"/></a></div></div>bush_devhttps://dotnetomaniak.pl/Users/KPn4sXtVe0SGEJ-UNiJPug2020-04-03T20:25:55Zhttps://dotnetomaniak.pl/Poisson-Regression-using-F-and-MLNET-bush_dev2150I wrote there about what this type of regression is and showed how it can be implemented in F # using the ML.NET library.http://bush-dev.com/poisson-regression-using-f-sharp-and-ml-net/http://dotnetomaniak.pl/Data/Thumbnails/small_ppoLBM_cqUSI_RVooRkYVA.pnghttps://dotnetomaniak.pl/How-to-check-if-a-number-is-a-power-of-twoHow to check if a number is a power of two2017-12-18T19:10:56Z<div><div><div style="float:right"><img alt ="" src="http://dotnetomaniak.pl/Data/Thumbnails/small_TsfnuPz4yU6ep_J-gLumqw.png"/></div><div>How to check if a number is a power of two</div></div><div style="padding-top:4px"><a rev="vote-for" href="https://dotnetomaniak.pl/How-to-check-if-a-number-is-a-power-of-two"><img alt="Podbij ↑" src="https://dotnetomaniak.pl/image.axd?url=https%3a%2f%2fmarcin-chwedczuk.github.io%2fhow-to-check-if-a-number-is-a-power-of-two" style="border:0px"/></a></div></div>asciiBladehttps://dotnetomaniak.pl/Users/quyZZh_L6U6TWaCY2Ix8Gw2017-12-28T07:50:49Zhttps://dotnetomaniak.pl/How-to-check-if-a-number-is-a-power-of-two31930How to check if a number is a power of twohttps://marcin-chwedczuk.github.io/how-to-check-if-a-number-is-a-power-of-twohttp://dotnetomaniak.pl/Data/Thumbnails/small_TsfnuPz4yU6ep_J-gLumqw.pnghttps://dotnetomaniak.pl/EN-Cassandra-logstime-series-storage-design-optimal-compaction-strategy[EN] Cassandra logs/time series storage design - optimal compaction strategy2017-02-23T08:59:44Z<div><div><div style="float:right"><img alt ="" src="http://dotnetomaniak.pl/Data/Thumbnails/small_D2pcP5G6SUStmfbdqwS0aw.png"/></div><div>Let's assume you are considering using Cassandra for logs storage or in general, for time series storage. You are well prepared - asked google extensively. Yet, there is a trap waiting to kill your cluster in few weeks after lunch.</div></div><div style="padding-top:4px"><a rev="vote-for" href="https://dotnetomaniak.pl/EN-Cassandra-logstime-series-storage-design-optimal-compaction-strategy"><img alt="Podbij ↑" src="https://dotnetomaniak.pl/image.axd?url=http%3a%2f%2fdynamicallyinvokable.blogspot.ca%2f2017%2f02%2fcassandra-logstime-series-storage.html" style="border:0px"/></a></div></div>http://dynamicallyinvokable.blogspot.com/https://dotnetomaniak.pl/Users/TAL6fpnUSEiNEXUR2fr7-g2017-02-25T20:13:08Zhttps://dotnetomaniak.pl/EN-Cassandra-logstime-series-storage-design-optimal-compaction-strategy1240Let's assume you are considering using Cassandra for logs storage or in general, for time series storage. You are well prepared - asked google extensively. Yet, there is a trap waiting to kill your cluster in few weeks after lunch.http://dynamicallyinvokable.blogspot.ca/2017/02/cassandra-logstime-series-storage.htmlhttp://dotnetomaniak.pl/Data/Thumbnails/small_D2pcP5G6SUStmfbdqwS0aw.pnghttps://dotnetomaniak.pl/EN-Dynamic-Programming-and-the-hardest-problem-on-HackerRank[EN]: Dynamic Programming and the hardest problem on HackerRank2016-12-21T21:43:43Z<div><div><div style="float:right"><img alt ="" src="http://dotnetomaniak.pl/Data/Thumbnails/small_nFuDBkORhEWkcwgnePE6Og.png"/></div><div>The hardest problem on HackerRank, sorted by Max Score and level "Expert" is Separate The Chocolate. It's worth 250 points and the level "Expert" is the highest one. How to solve it?</div></div><div style="padding-top:4px"><a rev="vote-for" href="https://dotnetomaniak.pl/EN-Dynamic-Programming-and-the-hardest-problem-on-HackerRank"><img alt="Podbij ↑" src="https://dotnetomaniak.pl/image.axd?url=http%3a%2f%2fdynamicallyinvokable.blogspot.com%2f2016%2f12%2fdynamic-programming-and-hardest-problem.html" style="border:0px"/></a></div></div>http://dynamicallyinvokable.blogspot.com/https://dotnetomaniak.pl/Users/TAL6fpnUSEiNEXUR2fr7-g2016-12-31T21:17:03Zhttps://dotnetomaniak.pl/EN-Dynamic-Programming-and-the-hardest-problem-on-HackerRank11080The hardest problem on HackerRank, sorted by Max Score and level "Expert" is Separate The Chocolate. It's worth 250 points and the level "Expert" is the highest one. How to solve it?http://dynamicallyinvokable.blogspot.com/2016/12/dynamic-programming-and-hardest-problem.htmlhttp://dotnetomaniak.pl/Data/Thumbnails/small_nFuDBkORhEWkcwgnePE6Og.pnghttps://dotnetomaniak.pl/EN-Dynamic-Programming-in-5-easy-steps-Examples-Two-Robots[EN]: Dynamic Programming in 5 easy steps - Examples - Two Robots2016-11-24T08:08:56Z<div><div><div style="float:right"><img alt ="" src="http://dotnetomaniak.pl/Data/Thumbnails/small_pC-f8sG7CUmtpCTDZRv6Ww.png"/></div><div>This time solving a HackerRank problem, rated as a medium in difficulty. As before, in 5 easy steps.</div></div><div style="padding-top:4px"><a rev="vote-for" href="https://dotnetomaniak.pl/EN-Dynamic-Programming-in-5-easy-steps-Examples-Two-Robots"><img alt="Podbij ↑" src="https://dotnetomaniak.pl/image.axd?url=http%3a%2f%2fdynamicallyinvokable.blogspot.com%2f2016%2f11%2fdynamic-programming-in-5-easy-steps.html" style="border:0px"/></a></div></div>http://dynamicallyinvokable.blogspot.com/https://dotnetomaniak.pl/Users/TAL6fpnUSEiNEXUR2fr7-g2016-12-01T07:21:17Zhttps://dotnetomaniak.pl/EN-Dynamic-Programming-in-5-easy-steps-Examples-Two-Robots1660This time solving a HackerRank problem, rated as a medium in difficulty. As before, in 5 easy steps.http://dynamicallyinvokable.blogspot.com/2016/11/dynamic-programming-in-5-easy-steps.htmlhttp://dotnetomaniak.pl/Data/Thumbnails/small_pC-f8sG7CUmtpCTDZRv6Ww.pnghttps://dotnetomaniak.pl/EN-Dynamic-Programming-in-5-easy-steps-Examples-Set-partitioning[EN]: Dynamic Programming in 5 easy steps - Examples - Set partitioning2016-10-31T13:18:09Z<div><div><div style="float:right"><img alt ="" src="http://dotnetomaniak.pl/Data/Thumbnails/small_2yytVTB6nUGyW5tGvAzZVw.png"/></div><div>Dynamic Programming series continuation. Something harder this time: Given a set of positive integers, divide it into two sets such that the absolute difference between their sums is minimum. Solution in 5 easy steps!</div></div><div style="padding-top:4px"><a rev="vote-for" href="https://dotnetomaniak.pl/EN-Dynamic-Programming-in-5-easy-steps-Examples-Set-partitioning"><img alt="Podbij ↑" src="https://dotnetomaniak.pl/image.axd?url=http%3a%2f%2fdynamicallyinvokable.blogspot.com%2f2016%2f10%2fdynamic-programming-in-5-easy-steps_31.html" style="border:0px"/></a></div></div>http://dynamicallyinvokable.blogspot.com/https://dotnetomaniak.pl/Users/TAL6fpnUSEiNEXUR2fr7-g2016-11-03T14:55:35Zhttps://dotnetomaniak.pl/EN-Dynamic-Programming-in-5-easy-steps-Examples-Set-partitioning1680Dynamic Programming series continuation. Something harder this time: Given a set of positive integers, divide it into two sets such that the absolute difference between their sums is minimum. Solution in 5 easy steps!http://dynamicallyinvokable.blogspot.com/2016/10/dynamic-programming-in-5-easy-steps_31.htmlhttp://dotnetomaniak.pl/Data/Thumbnails/small_2yytVTB6nUGyW5tGvAzZVw.pnghttps://dotnetomaniak.pl/EN-Dynamic-Programming-in-5-easy-steps-Examples-Text-Justification[EN]: Dynamic Programming in 5 easy steps - Examples - Text Justification2016-10-25T06:59:27Z<div><div><div style="float:right"><img alt ="" src="http://dotnetomaniak.pl/Data/Thumbnails/small_r27GdY5AhU2gKafnHbnqAw.png"/></div><div>Dynamic Programming is considered as one of the hardest methods to master, with few examples on the internet. Let's contribute a little with this post series. Today I will cover the first problem - text justification. Credits: MIT lectures.</div></div><div style="padding-top:4px"><a rev="vote-for" href="https://dotnetomaniak.pl/EN-Dynamic-Programming-in-5-easy-steps-Examples-Text-Justification"><img alt="Podbij ↑" src="https://dotnetomaniak.pl/image.axd?url=http%3a%2f%2fdynamicallyinvokable.blogspot.com%2f2016%2f10%2fdynamic-programming-in-5-easy-steps.html" style="border:0px"/></a></div></div>http://dynamicallyinvokable.blogspot.com/https://dotnetomaniak.pl/Users/TAL6fpnUSEiNEXUR2fr7-g2016-10-31T18:19:12Zhttps://dotnetomaniak.pl/EN-Dynamic-Programming-in-5-easy-steps-Examples-Text-Justification2830Dynamic Programming is considered as one of the hardest methods to master, with few examples on the internet. Let's contribute a little with this post series. Today I will cover the first problem - text justification. Credits: MIT lectures.http://dynamicallyinvokable.blogspot.com/2016/10/dynamic-programming-in-5-easy-steps.htmlhttp://dotnetomaniak.pl/Data/Thumbnails/small_r27GdY5AhU2gKafnHbnqAw.pnghttps://dotnetomaniak.pl/EN-Algorithms-and-data-structures-non-academic-trees[EN]: Algorithms and data structures - non-academic trees2016-08-18T07:19:09Z<div><div><div style="float:right"><img alt ="" src="http://dotnetomaniak.pl/Data/Thumbnails/small_OKiWlZ4p5E6XQ-46jhhk5g.png"/></div><div>Do you know the trees used in Cassandra, Git, Bitcoin or Lucene? Check this post to find interesting trees, usually not covered on Computer Science lectures.</div></div><div style="padding-top:4px"><a rev="vote-for" href="https://dotnetomaniak.pl/EN-Algorithms-and-data-structures-non-academic-trees"><img alt="Podbij ↑" src="https://dotnetomaniak.pl/image.axd?url=http%3a%2f%2fdynamicallyinvokable.blogspot.com%2f2016%2f08%2falgorithms-and-data-structures-non.html" style="border:0px"/></a></div></div>http://dynamicallyinvokable.blogspot.com/https://dotnetomaniak.pl/Users/TAL6fpnUSEiNEXUR2fr7-g2016-08-28T06:58:47Zhttps://dotnetomaniak.pl/EN-Algorithms-and-data-structures-non-academic-trees41160Do you know the trees used in Cassandra, Git, Bitcoin or Lucene? Check this post to find interesting trees, usually not covered on Computer Science lectures.http://dynamicallyinvokable.blogspot.com/2016/08/algorithms-and-data-structures-non.htmlhttp://dotnetomaniak.pl/Data/Thumbnails/small_OKiWlZ4p5E6XQ-46jhhk5g.pnghttps://dotnetomaniak.pl/EN-Little-known-useful-charming-and-beautiful-algorithms-part-2[EN]: Little-known, useful, charming and beautiful algorithms - part 22016-03-20T22:26:03Z<div><div><div style="float:right"><img alt ="" src="http://dotnetomaniak.pl/Data/Thumbnails/small_QG4KT-V0QEKY9jdI4snJvg.png"/></div><div>How many timers are in the .NET Framework? What assumptions do they have? Which timer would you use for implementing Speculative query execution?</div></div><div style="padding-top:4px"><a rev="vote-for" href="https://dotnetomaniak.pl/EN-Little-known-useful-charming-and-beautiful-algorithms-part-2"><img alt="Podbij ↑" src="https://dotnetomaniak.pl/image.axd?url=http%3a%2f%2fdynamicallyinvokable.blogspot.com%2f2016%2f03%2flittle-known-useful-charming-and.html" style="border:0px"/></a></div></div>http://dynamicallyinvokable.blogspot.com/https://dotnetomaniak.pl/Users/TAL6fpnUSEiNEXUR2fr7-g2016-03-23T20:12:39Zhttps://dotnetomaniak.pl/EN-Little-known-useful-charming-and-beautiful-algorithms-part-21720How many timers are in the .NET Framework? What assumptions do they have? Which timer would you use for implementing Speculative query execution?http://dynamicallyinvokable.blogspot.com/2016/03/little-known-useful-charming-and.htmlhttp://dotnetomaniak.pl/Data/Thumbnails/small_QG4KT-V0QEKY9jdI4snJvg.png