This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| isPrime = function(x){ | |
| // if number is 1 , 0 or negative it is not a prime | |
| if(x <= 1) return false; | |
| if(x == 2) return true ; | |
| for( var i = x - 1 ; i > 1 ; i-- ){ | |
| console.log(x + ' % ' + i + " " + x % i ); | |
| if(x % i == 0) return false; | |
| } | |
| return true; | |
| } |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| var num = "7316717653133062491922511967442657474235534919493496983520312774506326239578318016984801869478851843858615607891129494954595017379583319528532088055111254069874715852386305071569329096329522744304355766896648950445244523161731856403098711121722383113622298934233803081353362766142828064444866452387493035890729629049156044077239071381051585930796086670172427121883998797908792274921901699720888093776657273330010533678812202354218097512545405947522435258490771167055601360483958644670632441572215539753697817977846174064955149290862569321978468622482839722413756570560574902614079729686524145351004748216637048440319989000889524345065854122758866688116427171479924442928230863465674813919123162824586178664583591245665294765456828489128831426076900422421902267105562632111110937054421750694165896040807198403850962455444362981230987879927244284909188845801561660979191338754992005240636899125607176060588611646710940507754100225698315520005593572972571636269561882670428252483600823257530420752963450"; | |
| var adja |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| find_anagrams = function(arr , word){ | |
| return arr.filter(function(item){ | |
| for(var l in word){ | |
| if(item.indexOf(word[l]) == -1) return false; | |
| } | |
| return true; | |
| }) | |
| } | |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| function sortByRanking(rankingArray){ | |
| function compare(a,b) { | |
| if (a.ranking < b.ranking) | |
| return -1; | |
| if (a.ranking > b.ranking) | |
| return 1; | |
| return 0; | |
| } | |
| return rankingArray.sort(compare) |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| const createStore = (retucer) => { | |
| let state | |
| let listeners = [] | |
| const getState = ()=> state | |
| const dispatch = (action)=>{ | |
| state = reducer(state , action) | |
| listeners.forEach((listener) => listener() ) | |
| } | |
| const subscribe = (listener)=>{ |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| let array = [1,2,3,4] | |
| function reducer(state , action){ | |
| switch(action.type){ | |
| case "remove": | |
| return state.filter(function(elem , index){ | |
| return index != action.id | |
| }) | |
| case 'inc': |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| const todos(state=[] , action){ | |
| switch(action.type){ | |
| case 'add_todo': | |
| case 'remove_todo': | |
| case 'toggle_todo': | |
| return todo(state , action) | |
| default : | |
| return state | |
| } |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| const combineReducers = (reducers)=>{ | |
| return (state = {} , action)=>{ | |
| Object.keys(reducers).reduce(function( nextState , key ){ | |
| nextState[key] = reducers[key](state[key] , action); | |
| return nextState; | |
| } , {}) | |
| } | |
| } | |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| function toBase(number , base){ | |
| var s = "" | |
| do{ | |
| // binary reads from right to left | |
| s = String(number % base) + s | |
| number = Math.floor(number / base) | |
| }while (number > 0) | |
| return s | |
| } |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| def bubble_sort(a) | |
| i = 0 | |
| len = a.size - 1 | |
| while len >= i | |
| j = 0 | |
| while len > j | |
| if a[j] > a[j+1] |
OlderNewer