as mentioned in the question, I use recursion to calculate the approximate value of PI: PI/4 = 1-1 PI 3 + 1 hand 7 + 1 hand 9 +;
code is as follows:
let calPI = (n, sum = 1)=> {
if(n < 3)
return sum*4;
n%4 === 1 ? sum += 1/n : sum -= 1/n;
return calPI(n-2, sum);
}
console.log(calPI(99999)); calPI (9999) there is no stack overflow. Am I writing something wrong?
so far (July 3, 2018), other major browsers, such as Google (including v8, node.js) and Firefox, have not implemented TCO (Tail call optimization) in the javascript engine except Safari.
you can use other languages that implement TCO to test algorithms, such as C language.
V8 used to have tail recursive optimization, but now
has been deleted because tail recursive optimization destroys the call stack information of the function
Previous: How to represent tinyproxy again
Next: Iview's Modal disappears when you click OK? Is this design a little misunderstood?
js Recursive Sum 1, 2, 3, 3, 3, 3, 3, 3, 2, 1? ...
work needs to use a js recursive writing, really can not write it, ask for help, you can add Wechat to send a big red packet! The data structure of trustworthiness ~ is as follows: [ { key: 1 , name: name , label: ...
has the following recursive function, which cannot return the correct result: const navItems = [ { name: name1 , label: , items: [ { name: name2 , label: , items:...
function getTree ($data, $pId) { $tree = ; -------------------1 foreach ($data as $k = > $v) { if ($v [ cate_ParentId ] = = $pId) { Father finds son $v[ cate_ParentId ] = getTree($data, $v[ cate_Id ]); ---------------------2 ...
existing data: var res = [{ code: 1, name: "", children: [{ code: 1, name: "", children: [{ code: 1, name: "", children: [{ code: 1, ...
topic description I store user information in localStorage userInfo, to encapsulate a method to modify userInfo related codes userInfof var userInfo= { id: 123 , name: Jim , info:{ address:{ home: , ...
The Array.prototype.flat () method can flatten the nested array into flattening into one-dimensional array , accept a number as several layers of expansion, and defaults to layer 1 . If you expand no matter how many layers are nested, you can pass...
problem description The parameter is [number, distance] to find out the point coordinates satisfied in the two-bit plane of the browser. number: the number of coordinate points in the two-bit plane of the browser. distance: the distance between ea...