Awesome-Mirrors/OSSU-computer-science
1
0
Fork 0
mirror of https://github.com/ossu/computer-science.git synced 2024-10-01 01:26:01 -04:00
Code Issues Packages Projects Releases Wiki Activity

cube root of a perfect cube

Browse Source
This commit is contained in:
ericdouglas 2015-06-01 12:20:24 -03:00
parent 7445229287
commit f0711c0b7b
1 changed files with 60 additions and 25 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

71
computer-science/01-introduction-to-cs-and-programming-mit/src/02-lecture.js
View File

@ -53,38 +53,73 @@ var prompt = require( 'prompt' );
// });
// Find the lowest among three numbers
// // Find the lowest among three numbers
// prompt.start();
// prompt.get([
// {
// name : 'x',
// description : 'Enter x'
// },
// {
// name : 'y',
// description : 'Enter y'
// },
// {
// name : 'z',
// description : 'Enter z'
// }
// ], function( err, results ) {
// if ( results.x < results.y ) {
// if ( results.x < results.z ) {
// console.log( 'x is least' );
// } else {
// console.log( 'z is least' );
// }
// } else if ( results.y < results.z ) {
// console.log( 'y is least' );
// } else {
// console.log( 'z is least' );
// }
// });
// Find the cube root of a perfect cube
prompt.start();
prompt.get([
{
name : 'x',
description : 'Enter x'
},
{
name : 'y',
description : 'Enter y'
},
{
name : 'z',
description : 'Enter z'
description : 'Enter a interger'
}
], function( err, results ) {
if ( results.x < results.y ) {
var x = parseInt( results.x, 10 );
var ans = 0;
while ( Math.pow( ans, 3 ) < Math.abs( x )) {
ans += 1;
console.log( 'Current guess:', ans );
if ( results.x < results.z ) {
console.log( 'x is least' );
} else {
console.log( 'z is least' );
}
} else if ( results.y < results.z ) {
if ( Math.pow( ans, 3 ) !== Math.abs( x )) {
console.log( 'y is least' );
console.log( x, 'is not a perfect cube' );
} else {
console.log( 'z is least' );
if ( x < 0 ) {
ans = -ans;
}
console.log( 'Cube root of ' + x.toString() + ' is ' + ans.toString());
}