Click here to Skip to main content
15,916,180 members
Home / Discussions / Algorithms
   

Algorithms

 
QuestionWhich is the more preferred approach for novice coders, depth first search, or, breadth first search? Pin
the prestige city23-Jul-21 1:23
professionalthe prestige city23-Jul-21 1:23 
AnswerRe: Which is the more preferred approach for novice coders, depth first search, or, breadth first search? Pin
Gerry Schmitz24-Jul-21 7:15
mveGerry Schmitz24-Jul-21 7:15 
AnswerRe: Which is the more preferred approach for novice coders, depth first search, or, breadth first search? Pin
David Camp5-Oct-22 14:51
David Camp5-Oct-22 14:51 
AnswerRe: Which is the more preferred approach for novice coders, depth first search, or, breadth first search? Pin
prestige primrose hills phase 210-Nov-22 22:21
professionalprestige primrose hills phase 210-Nov-22 22:21 
AnswerRe: Which is the more preferred approach for novice coders, depth first search, or, breadth first search? Pin
Provident Ecopolitan Bagalur20-Jul-23 21:09
Provident Ecopolitan Bagalur20-Jul-23 21:09 
QuestionFind cartesians for matrix elements Pin
Member 1528858613-Jul-21 19:38
Member 1528858613-Jul-21 19:38 
QuestionGuess A Word If Number Of Character Matches Are Given Pin
Member 1525570320-Jun-21 20:54
Member 1525570320-Jun-21 20:54 
AnswerRe: Guess A Word If Number Of Character Matches Are Given Pin
OriginalGriff20-Jun-21 21:01
mveOriginalGriff20-Jun-21 21:01 
Two things:
1) "It's not working" is one of the most useless problem descriptions we get: it tells us absolutely nothing about the problem. We don't know if you get an error message, or the wrong data, or even that that code compiles successfully!
Remember that we can't see your screen, access your HDD, or read your mind - we only get exactly what you type to work with.
So tell us what happens when you run that code, what you expected to happen, how you checked what happened. Help us to help you!

2) While we are more than willing to help those that are stuck, that doesn't mean that we are here to do it all for you! We can't do all the work, you are either getting paid for this, or it's part of your grades and it wouldn't be at all fair for us to do it all for you.

So we need you to do the work, and we will help you when you get stuck. That doesn't mean we will give you a step by step solution you can hand in!
Start by explaining where you are at the moment, and what the next step in the process is. Then tell us what you have tried to get that next step working, and what happened when you did.

If you are having problems getting started at all, then this may help: How to Write Code to Solve a Problem, A Beginner's Guide[^]
Think about how you would do it manually: the number of "right letters" gives you lots of information.
AXCDG (0) - A is not the first, X is not the second, C is not the third, ...
FOUSE (4) - most of the letters are here, so look for identical letters in the others:
POWER (1) - Combined with FOUSE, the second is an O, the others aren't OP, W, E, or R
MOQRT (2) - Combined with FOUSE, and "2 is O", 1 is M

So ... MOUSE is the only possibility.
This isn't complicated, just think about it before leaping into code ...
"I have no idea what I did, but I'm taking full credit for it." - ThisOldTony
"Common sense is so rare these days, it should be classified as a super power" - Random T-shirt
AntiTwitter: @DalekDave is now a follower!

QuestionWhat are the in-order and post-order traversals of the following tree? Pin
priyamtheone20-May-21 5:02
priyamtheone20-May-21 5:02 
AnswerRe: What are the in-order and post-order traversals of the following tree? Pin
harold aptroot20-May-21 7:08
harold aptroot20-May-21 7:08 
GeneralRe: What are the in-order and post-order traversals of the following tree? Pin
priyamtheone20-May-21 9:37
priyamtheone20-May-21 9:37 
GeneralRe: What are the in-order and post-order traversals of the following tree? Pin
harold aptroot20-May-21 9:48
harold aptroot20-May-21 9:48 
QuestionAlgorithm to rank items lower if they already appear higher in another category Pin
Member 117824613-Mar-21 19:41
Member 117824613-Mar-21 19:41 
AnswerRe: Algorithm to rank items lower if they already appear higher in another category Pin
Ralf Meier9-Mar-21 5:55
mveRalf Meier9-Mar-21 5:55 
QuestionSaving Hierarchical (Treeview) object Iteratively with parent and child in C# Pin
Md NasirUddin24-Feb-21 5:35
Md NasirUddin24-Feb-21 5:35 
AnswerRe: Saving Hierarchical (Treeview) object Iteratively with parent and child in C# Pin
Gerry Schmitz24-Feb-21 6:28
mveGerry Schmitz24-Feb-21 6:28 
QuestionDesign a brute force algorithm to count the number of inversions in an array, analyze the number of executions of its basic operation, and determine the efficiency class. Pin
Ilyas Idrees8-Feb-21 5:42
Ilyas Idrees8-Feb-21 5:42 
AnswerRe: Design a brute force algorithm to count the number of inversions in an array, analyze the number of executions of its basic operation, and determine the efficiency class. Pin
20212a24-Feb-21 7:22
20212a24-Feb-21 7:22 
AnswerRe: Design a brute force algorithm to count the number of inversions in an array, analyze the number of executions of its basic operation, and determine the efficiency class. Pin
Patrice T25-Feb-21 2:57
mvePatrice T25-Feb-21 2:57 
QuestionLooking for "card playing" algorithm Pin
David Crow4-Jan-21 9:30
David Crow4-Jan-21 9:30 
AnswerRe: Looking for "card playing" algorithm Pin
Ralf Meier4-Jan-21 9:43
mveRalf Meier4-Jan-21 9:43 
AnswerRe: Looking for "card playing" algorithm Pin
Peter_in_27804-Jan-21 11:15
professionalPeter_in_27804-Jan-21 11:15 
GeneralRe: Looking for "card playing" algorithm Pin
jsc426-Jan-21 4:33
professionaljsc426-Jan-21 4:33 
GeneralRe: Looking for "card playing" algorithm Pin
Peter_in_27806-Jan-21 12:46
professionalPeter_in_27806-Jan-21 12:46 
AnswerRe: Looking for "card playing" algorithm Pin
Gerry Schmitz5-Jan-21 3:27
mveGerry Schmitz5-Jan-21 3:27 

General General    News News    Suggestion Suggestion    Question Question    Bug Bug    Answer Answer    Joke Joke    Praise Praise    Rant Rant    Admin Admin   

Use Ctrl+Left/Right to switch messages, Ctrl+Up/Down to switch threads, Ctrl+Shift+Left/Right to switch pages.