answersLogoWhite

0


Best Answer

a write the algorithm to concatenate two given string

User Avatar

Wiki User

12y ago
This answer is:
User Avatar

Add your answer:

Earn +20 pts
Q: A Write the algorithm to concatenate two given strings?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Related questions

Can you write an algorithm to solve the given problem?

Yes, an algorithm is a step-by-step procedure for solving a problem. It typically involves a series of instructions that can be followed to achieve a specific goal or outcome.


What is complsexity of an algorithm?

Complexity of an algorithm is a measure of how long an algorithm would take to complete given


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.


Write an algorithm to check whether the given number is odd or even?

Type your answer here... i think we should first enter 1 number then check it


Write algorithm and draw a flow chart to find the total and average of a student for six subjects?

write an algorithm to compute the weekly average rainfall given the daily rainfall for four weeks


How do you write a algorithm that gives the GCD of two given numbers?

algorithm GCD (a, b) is:while (a b) doif a > b then a := a - b else b := b - aend whilereturn a


Write algorithm to find the sum of the digits in a given 4 digit no ex- no is 8516 then 8 5 1 6?

I cannot do your homework, if you cannot explain it properly.


Why algorithm needs to solve programming problem?

This is the definition of an algorithm - a list of orders of how to solve a given programming problem.


How do you write an algorithm to find the number of times a given ITEM occurs in LIST?

You can write any algorithm in any way you like. Many prefer pseudocode or flowcharts, others use prose or more formalized methods. For example, if you wanted to describe an algorithm to count the number of occurrences of a given item I in a given list L, I would propose the following pseudocode: let counter be 0. let the current item C be the first item in list L. while C == valid { if C matches I then increment counter set C to the next item in the list } return counter.


How can the halting problem reduction be applied to determine the computability of a given algorithm?

The halting problem reduction can be used to determine if a given algorithm is computable by showing that it is impossible to create a general algorithm that can predict whether any algorithm will halt or run forever. This means that there are some algorithms for which it is impossible to determine their computability.


What is the proof of correctness algorithm and how does it ensure the accuracy and reliability of a given algorithm?

The proof of correctness algorithm is a method used to demonstrate that a given algorithm performs as intended and produces the correct output for all possible inputs. It involves creating a formal proof that the algorithm meets its specifications and behaves correctly under all conditions. By rigorously analyzing the algorithm's logic and structure, the proof of correctness ensures that it is accurate and reliable in its operations.


What is Vector generation algorithm?

It is a basic algorithm for generating lines on computer screen. line is generated between given 2 endpoints