2b:null 2c:["$","title",null,{"children":"Getting the Maximum Element of an Array | Michaël Guitton | Observable"}] 31:T70d,There is more than one way to find the greatest (or smallest) element in a numeric array. This notebook shows how the built-in `Math.max()` and `Math.min()` static methods can make this operation a snap. However, when an array has way too many elements, both spread (`...`) and `apply`-based solutions will either fail or return the wrong result as they try to pass the array elements as function arguments. The caveat here is that you run the risk of exceeding the JavaScript engine’s argument length limit. The consequences of applying a function with too many arguments (that is, more than tens of thousands of arguments) varies across engines. (The JavaScriptCore engine has a hard-coded argument limit of ${ 2 ** 16 }.) This is because that limit (and indeed, even the nature of any excessively-large-stack behavior) is unspecified. Some engines will throw an exception. More perniciously, others will arbitrarily limit the number of arguments actually passed to the applied function. When an array might grow into the tens of thousands, it is recommended that you use a `reduce`-based solution or an hybrid strategy which consists in feeding chunks of the array iteratively… A minor gotcha is that both `Math.max()` and `Math.min()` will return `NaN` if any of the provided arguments is or is converted into `NaN`: This effectively means that they won’t ignore `undefined`, `null`, and `NaN` values that may slip through in your data set. In this situation, I would advise you to use `d3.greatest()`, `d3.least()`, `d3.max()`, `d3.min()`, or `d3.extent()` — pick [whichever](/@d3/d3-least) [method](/@d3/d3-extent) that best suits your needs — which do not have this flaw, work with other types (such as strings and dates), and are far more performant than a `reduce`-based solution.32:[{"id":"1e1347c2226fb60f237d17839ada6f3c8300bc61c660a49c638f678da0a0efe7de52c43c4c257c3192e9653c45a84a6c100db2f8230228fb777e0a1165b244c5","href":"https://static.observableusercontent.com/files/1e1347c2226fb60f237d17839ada6f3c8300bc61c660a49c638f678da0a0efe7de52c43c4c257c3192e9653c45a84a6c100db2f8230228fb777e0a1165b244c5","name":"andrew-ridley-jR4Zf-riEjI-unsplash.jpg","type":"image/jpeg","lastModified":1668709989082.547,"size":931918}] 2f:{"id":"2b74b8b78906fc2b","slug":"getting-the-maximum-element-of-an-array","title":"Getting the Maximum Element of an Array","thumbnail":"20d1e21e7554df8c3e4e9f9162d477c31317450837ee4c108ae76435f9f88f47","access_level":"public","create_time":"$D2022-11-17T18:30:17.447Z","update_time":"$D2022-11-29T14:15:37.769Z","view_time":null,"first_public_time":"$D2022-11-17T18:50:27.396Z","fork":false,"stars":0,"starred":false,"owner":{"type":"team","id":"4c1622bb5c37477f","login":"galopin","name":"Michaël Guitton","avatar_url":"https://avatars-next.observableusercontent.com/10e2fe999ac95c8686156fd07e96a686520149a4eef18a95f97795b7a7be1e29","tier":"starter_2024"},"version":105,"publish_version":null,"role":null,"authored":false,"authors":[{"type":"individual","id":"950eb34948878085","login":"galopin","name":"Michaël Guitton","avatar_url":"https://avatars-next.observableusercontent.com/b59822ff41962e9448473fadd4a11819ac725b074ad3868aabf532bade0ac00d","tier":null}],"members":[{"type":"individual","id":"950eb34948878085","login":"galopin","name":"Michaël Guitton","avatar_url":"https://avatars-next.observableusercontent.com/b59822ff41962e9448473fadd4a11819ac725b074ad3868aabf532bade0ac00d","tier":null,"role":"editor"}],"comments":[],"custom_thumbnail":false,"trashed":false,"subscribed":null,"forks":0,"collection":null,"type":"notebook","body":{"title":"Getting the Maximum Element of an Array","cells":[{"id":0,"value":"# Getting the Maximum Element of an Array","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","output":"","database":"$undefined"},{"id":9,"value":"

${Object.assign(await FileAttachment(\"andrew-ridley-jR4Zf-riEjI-unsplash.jpg\").image(), { alt: 'Out on the Tiles', style: 'max-width: 1OO%; height: auto', title: 'Photo by Andrew Ridley (@aridley88) on Unsplash', width: 4488, height: 3366 })}","pinned":false,"hidden":false,"mode":"html","author":"$undefined","summary":"$undefined","output":"","database":"$undefined"},{"id":7,"value":"$31","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","output":"","database":"$undefined"},{"id":11,"value":"viewof toggle = Inputs.toggle({ label: \"Get maximum\", value: true })","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":13,"value":"viewof error = Inputs.toggle({ label: \"Trigger error\", value: false })","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":15,"value":"viewof undef = Inputs.toggle({ label: \"Undefined value?\", value: false })","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":33,"value":"array.includes(void 0)","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":35,"value":"d3.extent(array)","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":59,"value":"[getMinOf, getMaxOf][+toggle](array) === result","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":57,"value":"result = function () {}.constructor.call(\n null,\n [minOf, maxOf][+toggle].text.trim()\n)(array)","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":61,"value":"Math.max(...array)","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":63,"value":"Reflect.apply(Math.max, null, array)","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":65,"value":"Function(`return Math.max(${String(array).replace(/,+/g, \",\")})`)() // cope with undefined values!","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":67,"value":"Function(\n `return Math.max.apply(null, [${String(array).replace(/,+/g, \",\")}])`\n)() // bypass the erroneous 65535 maximum argument count in Blink browser engine…","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":69,"value":"getMaxOf(array)","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":71,"value":"findMaxOf(array)","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":73,"value":"Math.min(...array)","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":75,"value":"Reflect.apply(Math.min, null, array)","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":77,"value":"Function(`return Math.min(${String(array).replace(/,+/g, \",\")})`)() // cope with undefined values!","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":79,"value":"Function(\n `return Math.min.apply(null, [${String(array).replace(/,+/g, \",\")}])`\n)() // bypass the erroneous 65535 maximum argument count in Blink browser engine…","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":81,"value":"getMinOf(array)","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":83,"value":"findMinOf(array)","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":20,"value":"---","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","output":"","database":"$undefined"},{"id":37,"value":"","pinned":true,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","output":"maxOf","database":"$undefined"},{"id":43,"value":"getMaxOf = function (array) {\n return array.reduce(\n (\n (pass) => (a, b) =>\n Math.max(pass(a), pass(b))\n )(sieve(Math.max())),\n Math.max()\n );\n}","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":51,"value":"function findMaxOf(array) {\n let result = Math.max();\n\n for (let i = 0, length = array.length; i < length; ) {\n result = Math.max(\n Math.max.apply(null, array.slice(i, Math.min((i += chunk), length))),\n result\n );\n }\n\n return result;\n}","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":85,"value":"---","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","output":"","database":"$undefined"},{"id":40,"value":"","pinned":true,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","output":"minOf","database":"$undefined"},{"id":46,"value":"getMinOf = function (array) {\n return array.reduce(\n (\n (pass) => (a, b) =>\n Math.min(pass(a), pass(b))\n )(sieve(Math.min())),\n Math.min()\n );\n}","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":54,"value":"function findMinOf(array) {\n let result = Math.min();\n\n for (let i = 0, length = array.length; i < length; ) {\n result = Math.min(\n Math.min.apply(null, array.slice(i, Math.min((i += chunk), length))),\n result\n );\n }\n\n return result;\n}","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":87,"value":"---","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","output":"","database":"$undefined"},{"id":31,"value":"array.indexOf(void 0)","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":22,"value":"array = ((length) =>\n Array.from(\n { length },\n (\n (target) => (_, i) =>\n i === target ? void 0 : ++i\n )(undef ? Math.floor(Math.random(Math.sin(Date.now())) * length) : void 0)\n ))((1 + (error << 2)) * (2 ** 16 - 1))","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":25,"value":"chunk = 2 ** 15","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":27,"value":"sieve = (fallback) => (v) => v == null || v != v ? fallback : v","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":99,"value":"---","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","output":"","database":"$undefined"},{"id":98,"value":"The maximum number of arguments you can pass to a function is always going to be physically limited by the size of the stack.\n\nHere is another use case where this limitation may arise:","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","output":"","database":"$undefined"},{"id":97,"value":"{\n let copy = array.slice();\n copy.push.apply(copy, copy);\n yield copy.sort((a, b) => a - b);\n}","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":96,"value":"vs.","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","output":"","database":"$undefined"},{"id":95,"value":"{\n let copy = array.slice();\n for (let i = 0, length = copy.length; i < length; ) {\n copy.push.apply(copy, copy.slice(i, Math.min((i += chunk), length)));\n }\n yield copy.sort((a, b) => a - b);\n}","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"}],"files":"$W32","stdlib":"1","titling":"auto"}} 30:"$2f:body"