DotNetShoutout - Stories tagged with Algorithm
4
Shouts

Autocorrecting unknown actions using the Levenshtein distance

published 492 days, 18 hours, 49 minutes ago posted by http://jclaes.blogspot.com/http://jclaes.blogspot.com/ 497 days, 1 hour, 59 minutes ago
Thursday, January 19, 2012 10:35:12 PM GMT Sunday, January 15, 2012 3:25:19 PM GMT
This weekend I prototyped an idea I had earlier this week: autocorrecting unknown actions in ASP.NET MVC. (more)
category: Web Dev | clicked: 20 | comment | | source: jclaes.blogspot.com
tags: ASP.NET MVC, Routing, url, Algorithm
2
Shouts

Generic Multi-Level Undo and Redo (C#)

published 685 days, 9 hours, 28 minutes ago posted by BlackWaspBlackWasp 689 days, 18 hours, 21 minutes ago
Monday, July 11, 2011 7:56:34 AM GMT Wednesday, July 06, 2011 11:03:00 PM GMT
Most modern software applications include undo and redo features. Undo allows one or more activities to be reverted. Redo allows previous undo actions to be reversed. This article explains how to create a generic, multi-level undo and redo class. (more)
category: How To | clicked: 42 | comment | | source: www.blackwasp.co.uk
tags: C#, Algorithm
5
Shouts

Dijkstra's Algorithm

published 726 days, 5 hours, 39 minutes ago posted by BlackWaspBlackWasp 727 days, 19 hours, 7 minutes ago
Tuesday, May 31, 2011 11:45:38 AM GMT Sunday, May 29, 2011 10:17:24 PM GMT
Graph traversal algorithms are used to process a graph of interconnected nodes, visiting each node by following a set behaviour. Dijkstra's algorithm is such an algorithm. It determines the shortest path from a start point to all other nodes in a graph. (more)
category: How To | clicked: 22 | 1 comment | | source: www.blackwasp.co.uk
tags: C#, Algorithm
6
Shouts

Save on Computation Heavy Algorithms for Windows Phone 7 and Windows Azure

published 793 days, 10 hours, 4 minutes ago posted by http://tanzim.myopenid.com/http://tanzim.myopenid.com/ 795 days, 23 hours, 37 minutes ago
Friday, March 25, 2011 7:20:06 AM GMT Tuesday, March 22, 2011 5:47:27 PM GMT
Computation heavy algorithms cost more money before optimized. You can feed your server systems enough RAM and CPUs to handle the CPU cycles and memory they require. This is not one of the most recurring investments and generally good for the application it is serving overall. If you are developing Smart Client/Desktop applications, your software can take as much as it can as long as it is running. However, in two cases careful software design can save (saving is earning) obvious money: Windows Phone and... (more)
category: How To | clicked: 1 | comment | | source: tanzimsaqib.com
tags: data structures, Windows Azure, Windows Phone 7, Windows Phone, algorithms complexity, Algorithm
4
Shouts

Determining if Values are Coprime (C#)

published 901 days, 20 minutes ago posted by BlackWaspBlackWasp 901 days, 21 hours, 11 minutes ago
Tuesday, December 07, 2010 5:04:41 PM GMT Monday, December 06, 2010 8:13:44 PM GMT
Two integer values are said to be coprime, or relatively prime, when they share no common divisors other than the number one. This article describes the process for determining whether two positive values are coprime, with C# example code. (more)
category: How To | clicked: 1 | comment | | source: www.blackwasp.co.uk
tags: C#, Algorithm
3
Shouts

Project Euler Problem 14 in F# | Stefano Ricciardi

published 913 days, 20 hours, 24 minutes ago posted by stefanoricstefanoric 915 days, 3 hours, 20 minutes ago
Wednesday, November 24, 2010 9:00:16 PM GMT Tuesday, November 23, 2010 2:04:05 PM GMT
A solution to Project Euler problem 14 in F# (more)
category: How To | clicked: 1 | comment | | source: stefanoricciardi.com
tags: Functional Programming, memoization, FSharp, Algorithm
4
Shouts

Euclid's Algorithm (C#)

published 923 days, 5 hours, 5 minutes ago posted by BlackWaspBlackWasp 924 days, 5 hours, 43 minutes ago
Monday, November 15, 2010 12:19:44 PM GMT Sunday, November 14, 2010 11:41:05 AM GMT
Euclid's algorithm, also known as the Euclidean algorithm, can be used to efficiently calculate the greatest common divisor (GCD) for two integer values. This article describes the algorithm and provides several C# methods that calculate the GCD. (more)
category: How To | clicked: 0 | comment | | source: www.blackwasp.co.uk
tags: C#, Algorithm
2
Shouts

A RPN Calculator in F# | Stefano Ricciardi

published 966 days, 20 hours, 58 minutes ago posted by stefanoricstefanoric 968 days, 7 hours, 46 minutes ago
Saturday, October 02, 2010 8:26:24 PM GMT Friday, October 01, 2010 9:38:02 AM GMT
A simple RPN calculator implemented with F#. (more)
category: How To | clicked: 0 | comment | | source: stefanoricciardi.com
tags: F#, Algorithm
5
Shouts

Project Euler Problem 11 in F# | Stefano Ricciardi

published 976 days, 22 hours, 35 minutes ago posted by http://sterioma.pip.verisignlabs.com/http://sterioma.pip.verisignlabs.com/ 978 days, 1 hour, 52 minutes ago
Wednesday, September 22, 2010 6:49:45 PM GMT Tuesday, September 21, 2010 3:32:45 PM GMT
A solution to Project Euler Problem 11 in F# (more)
category: How To | clicked: 0 | comment | | source: stefanoricciardi.com
tags: Functional Programming, F#, Algorithm
5
Shouts

Project Euler Problem 10 in F# | Stefano Ricciardi

posted by http://sterioma.pip.verisignlabs.com/http://sterioma.pip.verisignlabs.com/ 985 days, 2 hours, 17 minutes ago
Tuesday, September 14, 2010 3:07:04 PM GMT
A solution to Project Euler Problem 10 in F# (more)
category: How To | clicked: 1 | comment | | source: stefanoricciardi.com
tags: F#, Algorithm
5
Shouts

The XOR Swap Algorithm (C#)

published 994 days, 4 hours, 21 minutes ago posted by BlackWaspBlackWasp 995 days, 23 hours, 1 minute ago
Sunday, September 05, 2010 1:03:40 PM GMT Friday, September 03, 2010 6:22:59 PM GMT
The XOR Swap algorithm provides a means to swap the values in two integer variables without requiring the use of a third, temporary variable. This algorithm is interesting to know, although its use is unnecessary in high-level languages. (more)
category: How To | clicked: 0 | comment | | source: www.blackwasp.co.uk
tags: C#, Algorithm
5
Shouts

Project Euler Problem 9 in F# | Stefano Ricciardi

published 1004 days, 5 hours, 45 minutes ago posted by http://sterioma.pip.verisignlabs.com/http://sterioma.pip.verisignlabs.com/ 1005 days, 1 hour, 45 minutes ago
Thursday, August 26, 2010 11:39:36 AM GMT Wednesday, August 25, 2010 3:39:15 PM GMT
A solution to Project Euler problem 9 in F#. (more)
category: How To | clicked: 0 | comment | | source: stefanoricciardi.com
tags: project euler, functional, F#, Algorithm
5
Shouts

Project Euler Problem 5 in F# | Stefano Ricciardi

published 1017 days, 6 hours, 20 minutes ago posted by http://sterioma.pip.verisignlabs.com/http://sterioma.pip.verisignlabs.com/ 1017 days, 20 hours, 41 minutes ago
Friday, August 13, 2010 11:04:45 AM GMT Thursday, August 12, 2010 8:43:06 PM GMT
A solution to Project Euler Problem 5 in F#. (more)
category: How To | clicked: 0 | 2 comments | | source: stefanoricciardi.com
tags: functional, euler, F#, Algorithm
7
Shouts

Project Euler Problem 4 in F# | Stefano Ricciardi

published 1024 days, 5 hours, 32 minutes ago posted by http://sterioma.pip.verisignlabs.com/http://sterioma.pip.verisignlabs.com/ 1025 days, 5 hours, 25 minutes ago
Friday, August 06, 2010 11:52:23 AM GMT Thursday, August 05, 2010 11:59:29 AM GMT
A solution to Project Euler Problem 4 in F# (more)
category: How To | clicked: 1 | comment | | source: stefanoricciardi.com
tags: euler, F#, Algorithm
2
Shouts

Musings of a Software Developer: Algorithms, performance and getting burnt

published 1045 days, 4 hours, 49 minutes ago posted by http://krishnabhargav.blogspot.com/http://krishnabhargav.blogspot.com/ 1045 days, 14 hours, 43 minutes ago
Friday, July 16, 2010 12:35:23 PM GMT Friday, July 16, 2010 2:40:59 AM GMT
After a long time, I am writing something on my blog. So here it is .. This post is about me starting to solve a small but interesting problem with different approaches and ended up breaking my head against why an algorithm with supposedly O(n) complexity is 4 times slower than O(n^2). So here's the issue. I have the following data : Name,Value Sridhar,1 Ashish,2 Prasanth,3 Sridhar,4 Ashish,5 Sridhar,8 and so on .. I hope you get the idea. Now what I would like to do is to prin... (more)
category: How To | clicked: 0 | comment | | source: krishnabhargav.blogspot.com
tags: Simple Code, Algorithm
4
Shouts

Project Euler Problem 3 in F# | Stefano Ricciardi

published 1060 days, 2 hours, 47 minutes ago posted by http://sterioma.pip.verisignlabs.com/http://sterioma.pip.verisignlabs.com/ 1060 days, 8 hours, 56 minutes ago
Thursday, July 01, 2010 2:37:39 PM GMT Thursday, July 01, 2010 8:28:22 AM GMT
Project Euler problem 3 solved using the new functional language from Microsoft. (more)
category: How To | clicked: 0 | comment | | source: stefanoricciardi.com
tags: Functional Programming, prime number, F#, Algorithm
6
Shouts

Project Euler Problem 1 and 2 in F# | Stefano Ricciardi

posted by http://sterioma.pip.verisignlabs.com/http://sterioma.pip.verisignlabs.com/ 1077 days, 5 hours, 44 minutes ago
Monday, June 14, 2010 11:39:52 AM GMT
Project Euler 1 and 2 resolved declaratively in F#. (more)
category: How To | clicked: 1 | comment | | source: stefanoricciardi.com
tags: sequence, F#, Algorithm
5
Shouts

The Soundex Algorithm (C#)

posted by BlackWaspBlackWasp 1198 days, 18 hours, 29 minutes ago
Friday, February 12, 2010 10:54:53 PM GMT
Cultural differences and input errors can lead to words being spelled differently to a user's expectations. This makes it difficult to locate information quickly. The Soundex algorithm can alleviate this by assigning codes based upon the sound of words. (more)
category: How To | clicked: 14 | comment | | source: www.blackwasp.co.uk
tags: soundex, C#, Algorithm
7
Shouts

Generating All Partitions of A Set C# Implementation - Vijai Kalyan

published 1252 days, 3 hours, 39 minutes ago posted by jantujantu 1254 days, 3 hours, 9 minutes ago
Monday, December 21, 2009 1:45:49 PM GMT Saturday, December 19, 2009 2:15:27 PM GMT
Generating All Partitions of A Set – C# Implementation The following is the C# implementation of the Fortran algorithm posted in the previous post for generating all possible partitions of a set of items. We consider the items to be unique although they may be the same item (that is Object.Equals returns true) for one or more items in the input set. This is a straightforward implementation that uses a “lazy” enumerator. The implementation is broken into three parts: the first is the IEnumerable implemen... (more)
category: How To | clicked: 8 | 1 comment | | source: blogs.msdn.com
tags: C#, combinatorial, Algorithm