Skip to main content

higher order function in javascript a little and neat implementation of higher order function in javascript

working example

https://stackblitz.com/edit/js-in2ztw



//higher order function is like
let arr1=[11,10,7,8,9,51];
let arr2=[5,3,89,7,6,4];
let arr3=[1,2,3,4,5,6];
let arr4=[5,6,7,8,1008,11];
//get min from first array and max from second
const minMax=(...args)=>{
  let fns=args;
  return (...args)=>{
    const result=0;
    for(let i=0;i<fns.length;i++)
    {
      let func=fns[i];
      result+=func(...args[i]);
    }
    return result;
  }
}
const opArray=[arr1,arr2,arr3,arr4];
const mathOp=[Math.min,Math.max,Math.min,Math.max];
console.log(minMax(...mathOp)(...opArray));

//so what you mean by a hoc (higher order function a function thats accept another function as a parameter and return a manipulated function )

//thats whats minMax function doing

//let take a simple example 

//a higher order function which accept a function as a parameter
const fullName=(fn)=>{
  return (...args)=>{
    const lastName="chauhan";
    return fn(args[0])+" "+lastName;
  }
}

//hoc parameter function
const name=(name)=>{
  return name;
}

console.log(fullName(name)("manish"));
console.log(fullName(name)("sachin"));
console.log(fullName(name)("deepak"));

//a real life example marks and percentage based
let student1Marks=[33,56,33,67,54];
let student2Marks=[89,99,78,67,66];
let student3marks=[90,87,43,52,67];
//get student percentage 
const getPercenTage=(fn)=>{
  return (args)=>{
      const sum=fn(args);
      const total=500;
      return Math.round(sum*100/total);
  }
}
const sum=(arr)=>{
   let sum=0;
   for(let i=0;i<arr.length;i++)
   {
      sum+=arr[i];
   }
   return sum;
}

console.log(getPercenTage(sum)(student1Marks))
console.log(getPercenTage(sum)(student2Marks))
console.log(getPercenTage(sum)(student3marks))



Comments

Popular posts from this blog

Creating a word Scramble game where you can drag and drop the word and create a complete word. (drag and drop word Scramble game).

Creating a word game using  phaser game engine which is a javascript based gaming engine  where u can drag and drop world like Word Scramble Game and complete a given word. your index.html file look like below < html > < head > < script src = "src/phaser.min.js" ></ script > < script src = "src/wordGame.js" ></ script > < script src = "src/main.js" ></ script > </ head > < body > </ body > </ html > 1.    <script src="src/phaser.min.js"></script> required to run the  phaser game engine. 2. rest of the two files deals with game logics      <script src="src/wordGame.js"></script>       <script src="src/main.js"></script> you can download whole project from https://github.com/manishchauhan/wordgame/tree/master just copy and paste the project in your local server and run ...

starting with three.js and react with a very simple example

 1. three.js is undoubtedly the best library to create interactive content for the web in 3d. link https://threejs.org/ a working sample of three with react can be found below https://stackblitz.com/edit/react-7n5qf9?file=src%2FApp.js why choose threejs 1. lightweight  2.fast 3.big community  https://discourse.threejs.org/ 4. even you can use unity or unreal to publish html5 content but i don't think that would be acceptable in many cases. 5. open-source project. i created a running sample with React  https://stackblitz.com/edit/react-7n5qf9?file=src%2FApp.js

A simple binary search tree with generic approach tree can store any type of data. (DFS and BFS)

 1. a binary search tree in c++ using a generic approach with both BFS and DFS approach    working tree    https://www.onlinegdb.com/edit/HkuQLdA-w code=> some properties of binary search tree-> 1. binary search tree is not always a balanced tree.  2. Inorder, traversing gives you sorted data.  3.  best is o(log n) and worst is O(n).  4. left node data is always less than root data and right node data always be greater than root data.  5. red-black tree STL map is a balanced binary search tree. *******************************************************************************/ #include <stdio.h> #include<iostream> #include<queue> using namespace std; template < typename T > class Node {   //can store any type of data private:   //genric data or store any type of data   T data;   //reference of left pointer   Node *left = nullptr;   //reference of right pointer   Node *rig...