1. develop an algorithm which reads two decimal numbers x and y and determines and prints out wether x>y or y>x. the input values, x and y, are whole number > or equal to 0, which are input by a single read, i.e. they cannot be read or "looked at" digit by digit. The two input values are guaranteed not to be equal to one another. for this question its is not possible to compare two numbers directly, however, comparison of two digits is allowed. you are allowed to use of all basic arithmetic operations. As well, n named sub-algorithm called Power (a,b), when invoked returns a^b, can be used.

Posted Date: 9/23/2012 3:13:21 PM | Location : United States

Ask an Expert

Related Discussions:- Comp. sci algorithms, Assignment Help, Ask Question on Comp. sci algorithms, Get Answer, Expert's Help, Comp. sci algorithms Discussions

Write discussion on Comp. sci algorithms
Your posts are moderated

Write your message here..

Related Questions

Stack and queue, write a algorithsm in c to perform push and pop operation... write a algorithsm in c to perform push and pop operations stastic implementation using array ?

Array implementation of a queue, Since the stack is list of elements, the q... Since the stack is list of elements, the queue is also a list of elements. The stack & the queue differ just in the position where the elements may be added or deleted. Similar to

Consistent heuristic function - graph search, Consistent Heuristic Function... Consistent Heuristic Function - Graph Search Recall the notions of consistency and admissibility for an A* search heuristic. a. Consider a graph with four nodes S, A, B, C,

Red black tree, red black tree construction for 4,5,6,7,8,9 red black tree construction for 4,5,6,7,8,9

Minimum cost spanning trees, A spanning tree of any graph is only a subgrap... A spanning tree of any graph is only a subgraph that keeps all the vertices and is a tree (having no cycle). A graph might have many spanning trees. Figure: A Graph

Algorithms for push and pop operation, Q. Suggest a method of implementing ... Q. Suggest a method of implementing two stacks in one array such that as long as space is there in an array, you should be capable to add an element in either stack. Using proposed

Linear node is given by means of pointer, A linear collection of data eleme... A linear collection of data elements where the linear node is given by means of pointer is known as Linked list

Darw a flowchart that inputs country someone is visiting, Regis lives in Br... Regis lives in Brazil and frequently travels to USA, Japan and Europe. He wants to be able to convert Brazilian Reais into US dollars, European euros and Japanese yen. Conversion f

Which are the two standard ways of traversing a graph, Which are the two st... Which are the two standard ways of traversing a graph? i. The depth-first traversal   ii. The breadth-first traversal

Graph connectivity, A connected graph is a graph wherein path exists among ... A connected graph is a graph wherein path exists among every pair of vertices. A strongly connected graph is a directed graph wherein every pair of distinct vertices is connecte