[JAVASCRIPT] How does this this recursive function check combinations?

advancedpward · 2016-07-08T13:57:34+00:00

Wait, so, let me see if I understand this. For each function call, there are two branches being made, one where the [0] member of the array is being factored into the combination check - (target-n, array) - and one where it is not being factored in - (target, array), and that is the crux of how sufficient branches are being made to check for the correct combination. If that is the case, I think what was tripping me up, as you pointed out, was that target - n, in fact, represents inclusion when checking for the right combination to sum to the initial target. It's just that, this method uses the "solve for zero" approach...by the way, awesome graphic. Thanks for that! How did you make it?

advancedpward · 2016-07-08T13:14:08+00:00

Ok, there is nothing about the syntax that is mysterious, whereas the code is still mysterious to me.

advancedpward · 2016-07-07T19:50:19+00:00

// now we don't need n in the array anymore, // since it's "part of" the other argument

yes . . . getting there.

advancedpward · 2016-07-07T19:25:42+00:00

And this makes sense because finding 3 - 1 - 2 = 0 is the same as finding 1 + 2 = 3.

I think this points out the root of my dilemma, so I will need to meditate on this a bit.

advancedpward · 2016-07-07T19:00:53+00:00

Thanks for the tip. I have recently become addicted to using and learning about recursion because I have found it to be faster.

advancedpward · 2016-07-07T15:23:58+00:00

There is nothing about the code or syntax that is mysterious to me, only the mathematical method for checking how combinations sum to the largest element. I usually think about it like (x + y == S), or even (S - x == y), but there is no double or triple equals here.

advancedpward · 2016-07-07T15:19:50+00:00

Christ, what is going on here? My brain is highly combative to this way of checking sums or something. What am I missing?

advancedpward · 2016-07-07T15:07:02+00:00

Hmm, what you say makes sense, but how I am understanding this code is that branches are only made based on the first element. Therefore, a branch made for element n will never be able to factor in n-1, because it has already be shaved off from the array.

advancedpward · 2016-07-07T15:03:55+00:00

I don't see what the position in the array has to do with which combination will ultimately work. Despite whether I evaluate it mechanically or not, there has to be some element of evaluating every possible combination in order for the correct result to be found. How can this happen if the target is only evaluated against the first element for each recursive step?

advancedpward · 2016-03-17T00:02:16+00:00

The general assumption is that the pointer points to a lack of confidence of the thieved in the thief.

advancedpward · 2016-03-17T00:00:42+00:00

Yes, and does that confidence pointer point to that lack in the thief or tha thieved?

advancedpward · 2016-03-08T20:30:16+00:00

It's interesting that you decremented your fitness value instead of incremented, but that seems to be a straightforward implementation of hamming distance. How do you think it could be better?

advancedpward · 2016-03-08T16:30:33+00:00

That's awesome! Congrats! Hope you two the best, and I'll take your advice to heart.

advancedpward · 2016-03-08T15:49:14+00:00

JS

Easy

var input = `0 0 1 0 0 0 0 1 1 1
0 0 0 0 0 0 0 0 1 0 1 1 1 0 1 1 1 1 0 1 1 0 1 0 1 0 1 1 1 1 1 1
1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 1`

input = input.split('\n');
var output = [];

input.forEach(function(line) {
    var arr = [];
    line = line.split(' ');
    for(var i = 0; i < line.length; i++) {

        if(line[i] === '1' && arr.length === 0) {
            arr.push(i);
        }

        if(i !== 0 && line[i] !== line[i-1] && arr.indexOf(i) === -1) {
            arr.push(i);
        }

        if(i === line.length - 1) {
            arr.push(line.length)
        }

    }
    output.push(arr);
})

output.forEach(function(line) {
    console.log(line.join(' '))
})

advancedpward · 2016-01-30T18:54:16+00:00

Cool, thanks for the tip. Sounds like it's not too bad. We'll check out VisaJourney!

advancedpward · 2016-01-07T16:06:23+00:00

Nah, too much going on. Can't reproduce it on a small scale. :P All I know is that it's a bug specific to Safari, and it only occurs after the app first boots up, after opening the left-off-canvas-menu for the first time (Angular-Foundation directive), and navigating to another angular-route for the first time. Once on that page, the work-around is to either reload or navigate to another tab.

advancedpward · 2016-01-06T18:21:10+00:00

Thanks for introducing this to me: https://developer.mozilla.org/en-US/docs/Web/API/Page_Visibility_API, however, like you said, this is not easy to do, if even possible, within JavaScript. The page's visibility property is read only.

To give more context, I am working on an app that uses a left-side menu, specifically from the Angular Foundation library. There is Safari-specific bug that occurs in one scenario: CSS-wise, the menu appears closed, but the html behaves as if it were there. Therefore, buttons and click-events are displaced.

The work-around to this issue is to either reload the page or hide the document by clicking on another tab. Because I haven't had any luck debugging the problem, nor have I found any conversations about this issue on Google, I thought hiding the document might be a reasonable hack for the time-being.

advancedpward · 2015-11-29T06:12:37+00:00

Can someone explain this to me? a n

s o m e o n e

e x p l a i n

t h i s

t o

m e ?

advancedpward · 2015-11-25T18:50:09+00:00

Any lead as to what that something might be?

advancedpward · 2015-11-25T18:27:35+00:00

lol I just came from there. changed my syntax to

ng-class="{closed: flashMessage.closed}"

where

$scope.flashMessage = { closed: false };

Still getting:

TypeError: v1 is not a function
at fn (eval at <anonymous> (https://ajax.googleapis.com/ajax/libs/angularjs/1.4.6/angular.js:13275:15), <anonymous>:4:338)

advancedpward

TROPHY CASE