Purchase Solution

The divide-and-average algorithm

Not what you're looking for?

Ask Custom Question

The divide-and-average algorithm for approximating the square root of any positive number a is as follows: Take any initial approximation x that is positive, and then find a new approximation by calculating the average of x and a/x, that is, (x + a/x)/2. Repeat this procedure with x replaced by this new approximation, stopping when x and a/x differ in absolute value by some specified error allowance, such as 0.00001. Write a program that reads values for x, a, and the small error allowance and then uses this divide-and-average algorithm to find the approximate square root of x. Execute the program with a=3 and error allowance=0.00001, and use the following initial approximationa: 1, 10, 0.01, and 100. Also execute the program with a=4, errow allowance=0.00001, and initial approximations 1 and 2.

Purchase this Solution
Solution Summary

The divide-and-average algorithm is used here.

Purchase this Solution
Free BrainMass Quizzes
Word 2010: Table of Contents

Ever wondered where a Table of Contents in a Word document comes from? Maybe you need a refresher on the topic? This quiz will remind you of the keywords and options used when working with a T.O.C. in Word 2010.

Inserting and deleting in a linked list

This quiz tests your understanding of how to insert and delete elements in a linked list. Understanding of the use of linked lists, and the related performance aspects, is an important fundamental skill of computer science data structures.

C# variables and classes

This quiz contains questions about C# classes and variables.

Basic Computer Terms

We use many basic terms like bit, pixel in our usual conversations about computers. Are we aware of what these mean? This little quiz is an attempt towards discovering that.

Word 2010: Tables

Have you never worked with Tables in Word 2010? Maybe it has been a while since you have used a Table in Word and you need to brush up on your skills. Several keywords and popular options are discussed as you go through this quiz.

View More Free Quizzes
Related BrainMass Solutions

  • Search using a divide-and-conquer algorithm

    140659 Search using a divide-and-conquer algorithm Design and analyze a divide-and-conquer algorithm for finding the maximum element in a list L[0:n-1]. The assumption is that this list isn't sorted.

  • Complex Numbers : Find Greatest Common Divisor ( GCD ) using the Euclidean Algorithm

    117643 Greatest Common Divisor ( GCD ) using the Euclidean Algorithm Using the gcd for 85 and 1+13i, by the Euclidean Algorithm. Please see the attached file for the complete solution. Thanks for using BrainMass.

  • Algorithm: Divide a group of people into two disjoint subgroups.

    92537 Algorithm: Divide a group of people into two disjoint subgroups.

  • Simple algorithm using the big theta - notation

    For example, find a simple algorithm for solving the following problem and classify it using big-theta notation: Divide a group of people into two disjoint subgroups (of arbitrary size) such that the difference in the total ages of the members of the

  • shortest path

    You can use either A* or Floyd-Warshall algorithm to accomplish this. One way that I think might work is to divide the path into 3 sections. Finding the shortest path from node 16 to 3 then from 3 to 11 and then from 11 to 16.

  • Finding Square Roots

    It can never lead to any mistake regarding the decimal. It is much faster also as compared to other methods. Suppose that you wish to calculate the square root of a number A. The divide-and-average algorithm is: 1.

  • Java data structures and alg.

    Plot the average number of comparisons (C) for the two sorting algorithms (merge sort and insertion sort) as a function of the length of the list. Which algorithm is better for sorting short lists?

  • Proofs for minimum spanning trees

    Here is a divide and conquer algorithm for finding MST of a graph G: Divide V(G) to two arbitrary subsets V1 and V2 so that |V1| = [|V(G)|/2] and there is at least one edge between V1 and V2 in G.

  • Polynomial division

    215345 Divide Divide x3 + 2 x2 + x +12 by ( x - 3) (x^3 + 2 x^2 + x +12)/( x - 3) We use long division algorithm x^2 +5x+16 ------

View More Related Solutions