DotNetShoutout - Stories tagged with algorithms

algorithms

atom rss
2
Shouts
spam Shout it Mute it

Tree Graph Ordered Traversal Level by Level in C#
published 555 days, 15 hours, 28 minutes ago posted by lenielleniel 556 days, 4 hours, 43 minutes ago
Friday, November 11, 2011 2:13:31 AM GMT Thursday, November 10, 2011 12:58:48 PM GMT
Recently as part of a job interview process, I was asked to solve some programming problems. This post shows the solution for one of such problems. Consider a tree of integers. Knowing that its root node is 0, and given its adjacency list as a two dimensional array of integers, write a function that prints out the elements/nodes in order/level by level starting from the root. That is, the root is printed in the first line, elements that can be reached from the root by a path of distance 1 in the second l... (more)
category: How To | clicked: 12 | 1 comment | | source: www.leniel.net
tags: data structures, algorithms, Programming, C#, graph, Parallel Programming, job interview, traversal, Tree, queue
4
Shouts
spam Shout it Mute it

A Generic Circular Buffer (.NET)
published 557 days, 2 hours, 51 minutes ago posted by BlackWaspBlackWasp 558 days, 17 hours, 22 minutes ago
Wednesday, November 09, 2011 2:50:27 PM GMT Tuesday, November 08, 2011 12:19:36 AM GMT
A circular buffer is a type of fixed size, first in, first out queue. The spaces in the buffer can be thought of as connected in a ring. Items in the buffer are never moved. Instead, changeable pointers are used to identify the head and tail of the queue. (more)
category: How To | clicked: 23 | 2 comments | | source: www.blackwasp.co.uk
tags: data structures, algorithms, C#
3
Shouts
spam Shout it Mute it

Simple sorting in JavaScript
published 672 days, 9 hours, 4 minutes ago posted by http://jclaes.blogspot.com/http://jclaes.blogspot.com/ 676 days, 22 hours, 33 minutes ago
Sunday, July 17, 2011 8:37:44 AM GMT Tuesday, July 12, 2011 7:08:53 PM GMT
In this post some of the simple sorting algorithms are implemented in JavaScript: bubble sort, insertion sort and selection sort. (more)
category: Web Dev | clicked: 16 | 3 comments | | source: jclaes.blogspot.com
tags: algorithms, SORTING, JavaScript
4
Shouts
spam Shout it Mute it

Top 15 Tricky Algorithm Interview Questions
published 818 days, 19 hours, 37 minutes ago posted by http://agafonovslava.blogspot.com/http://agafonovslava.blogspot.com/ 820 days, 21 hours, 7 minutes ago
Sunday, February 20, 2011 10:04:43 PM GMT Friday, February 18, 2011 8:34:47 PM GMT
How can you answer on tricky algorithmic questions when you have lack of time. The secret to success with this free-form question is to focus and practice. Never "wing it." What do you want the interviewer to remember most about you? List five strengths you have that are pertinent to this job: experiences, traits, skills, personality etc. Because if you prepare for the tough interview questions ahead of time, you'll likely do very well and actually enjoy the process. (more)
category: Screencast | clicked: 20 | comment | | source: blog.agafonov.net.ua
tags: algorithms
3
Shouts
spam Shout it Mute it

Algorithm theory and complexity introduction
published 853 days, 7 hours, 50 minutes ago posted by http://agafonovslava.blogspot.com/http://agafonovslava.blogspot.com/ 855 days, 21 hours, 25 minutes ago
Monday, January 17, 2011 9:51:42 AM GMT Friday, January 14, 2011 8:16:22 PM GMT
"Before there were computers, there were algorithms." - H.Cormen. But now that there are computers, there are even more algorithms, and algorithms lie at the heart of computing. What are algorithms? Informally, an algorithm is any well-defined computational procedure that takes some value, or set of values, as input and produces some value, or set of values, as output. An algorithm is thus a sequence of computational steps that transform the input into the output. (more)
category: Podcast | clicked: 4 | comment | | source: blog.agafonov.net.ua
tags: algorithms, sorting algorithms, algorithms complexity
7
Shouts
spam Shout it Mute it

Comparing Floating Point Numbers
published 1172 days, 6 hours, 11 minutes ago posted by http://sterioma.pip.verisignlabs.com/http://sterioma.pip.verisignlabs.com/ 1174 days, 3 hours, 56 minutes ago
Thursday, March 04, 2010 11:31:14 AM GMT Tuesday, March 02, 2010 1:45:24 PM GMT
How to create your own comparer for doubles to get rid of rounding errors in unit tests. (more)
category: How To | clicked: 1 | 2 comments | | source: stefanoricciardi.com
tags: algorithms, C#, floating points
9
Shouts
spam Shout it Mute it

Calculate the Number of Business Days in a Range (C#)
published 1222 days, 5 hours, 24 minutes ago posted by BlackWaspBlackWasp 1225 days, 5 hours, 28 minutes ago
Wednesday, January 13, 2010 12:17:38 PM GMT Sunday, January 10, 2010 12:14:00 PM GMT
A common task is to calculate the number of business days that exist within a date range. In most western cultures, these are the days from Monday to Friday and excluding Saturdays and Sundays. The resultant number should also exclude national holidays. (more)
category: How To | clicked: 4 | comment | | source: www.blackwasp.co.uk
tags: .NET, algorithms, C#
7
Shouts
spam Shout it Mute it

Rick Minerich's Development Wonderland : Steepest Ascent Hill Climbing in C# and F#
published 1236 days, 3 hours, 28 minutes ago posted by http://radicalreinvention.blogspot.com/http://radicalreinvention.blogspot.com/ 1237 days, 2 hours, 20 minutes ago
Wednesday, December 30, 2009 2:13:47 PM GMT Tuesday, December 29, 2009 3:21:31 PM GMT
Recently I’ve been working with some local search techniques and wanted to share my Steepest Ascent Hill Climbing solution. The general idea of Steepest Ascent Hill Climbing is that in each iteration of the hill climbing process you apply a set of transforms to your input data and select the best result via a fitness function.  This result, or the transform which created it, is then the input for your next iteration.  The process stops when no transform in an iteration scored higher than the previous ge... (more)
category: How To | clicked: 1 | comment | | source: www.atalasoft.com
tags: algorithms, C#, F#
13
Shouts
spam Shout it Mute it

A* pathfinding search in C# - Part 3
published 1263 days, 8 hours, 35 minutes ago posted by lenielleniel 1264 days, 13 hours, 37 minutes ago
Thursday, December 03, 2009 9:06:40 AM GMT Wednesday, December 02, 2009 4:05:17 AM GMT
This is the last installment in the series about A* search. The C# source code implemented is available in the final part of this post. As promised in the last words of A* pathfinding search in C# - Part 2 today we’re gonna run a test case using the Romania map. This post shows a test case in which the application outputs the shortest path from Arad to Bucharest. I used the ViewOtherPaths method to show the different possible routes. This way we can have a look at why the A* algorithm has chosen such sho... (more)
category: How To | clicked: 0 | comment | | source: www.leniel.net
tags: data structures, priority queue, algorithms, Programming, C#, A*, immutable data structures, Haversine, geocoder
10
Shouts
spam Shout it Mute it

A* pathfinding search in C# - Part 2
posted by lenielleniel 1264 days, 13 hours, 38 minutes ago
Wednesday, December 02, 2009 4:03:48 AM GMT
This post describes step by step the methods used to implement the A* search algorithm. To illustrate the path finding problem and how it can be solved using A* I decided to use the Romania map (with the same Cities I used in Breadth and depth first search series of posts). Now I modified it adding more connections between the cities so that we have more fun while debugging the code. This time I decided to get the real values of latitude and longitude for the cities shown in the Romania map. See how a gr... (more)
category: How To | clicked: 0 | comment | | source: www.leniel.net
tags: data structures, priority queue, algorithms, Programming, C#, A*, immutable data structures, Haversine, geocoder