0
What else can I help you with?
Write and explain recursive backtracking algorithm for n-queens?
This is not a question, this is your homework. For a start, read this: https://en.wikipedia.org/wiki/Eight_queens_puzzle
Can you write an algorithm to find the beast numbers?
maybe
Write an algorithm to check whether a number is a prime number or not?
You can write out this algorithm. This will then be programmed into the device to make determining prime numbers easier.
What is recursive algorithm and write a recursive algorithm to reverse a string also trace it for any string data?
A recursive algorithm is an algorithm which calls itself with "smaller (or simpler)" input values, and which obtains the result for the current input by applying simple operations to the returned value for the smaller (or simpler) input. Heres a recursive algorithm to reverse a string char *rev(char str[],int pos1,int pos2) { if(pos1<pos2) { char temp=str[pos1]; str[pos1]=str[pos2]; str[pos2]=temp; return rev(str,pos1+1,pos2-1); } return str; } You can call this function like this char *r=rev("reverse it",0,9);
Write algorithm and draw flowchart to find the sum of even numbers?
jgfujtf
Where do you run an algorithm?
By preparing test cases we can test an algorithm. The algorithm is tested with each test case.
Write an algorithm to print sum of all even numbers?
Start print "the sum of all even numbers is infinite" end
Write an algorithm and draw a corresponding flowchart to search a number in the given list of numbers and also display its position?
please give me an algorithm and a corresponding flow chart that displays list of numbers from 1 to 20.
Why recursive solution is better for tree traversal?
Because a tree is a recursive data-structure. It's easier to write (and easier to understand) a recursive program for handling it.
What is algorithm to write algorithm to the program to access a pointer variable in structure?
Here is the algorithm of the algorithm to write an algorithm to access a pointer in a variable. Algorithmically.name_of_the_structure dot name_of_the _field,eg:mystruct.pointerfield
Write an algorithm to find the root of quadratic equation?
Write an algorithm to find the root of quadratic equation
How do you write an algorithm which takes students marks and grades them as follows Mark greater than 60 Pass?
To write an algorithm that grades students based on their marks, you can follow these steps: Input: Accept the student's marks as input. Condition Check: Use a conditional statement to check if the marks are greater than 60. Output: If the condition is true, output "Pass"; otherwise, output "Fail". Here’s a simple pseudocode representation: Input: student_marks If student_marks > 60 then Output "Pass" Else Output "Fail" End If
