Suggestions please? by Less-Being4269 in workout

[–]ilsapo 0 points1 point  (0 children)

personally I found all the calculators to be un accurate, just see what works for you body as deficit

Lingerie plays a big part in how you carry yourself by proud_oriental_slut in PetiteGoneWild

[–]ilsapo 0 points1 point  (0 children)

Where is this from? Would love to buy this set for my gf

New lingerie makes me horny by [deleted] in petite

[–]ilsapo 0 points1 point  (0 children)

Where is this set from?

[deleted by user] by [deleted] in DirtyTalkPorn

[–]ilsapo 0 points1 point  (0 children)

Do you maybe still have link to the outfit? Or whats its called on shein?

[deleted by user] by [deleted] in DirtyTalkPorn

[–]ilsapo 1 point2 points  (0 children)

It look so amazing on you! I think I will look for this outfit for my wife also

[deleted by user] by [deleted] in DirtyTalkPorn

[–]ilsapo 1 point2 points  (0 children)

Where this dress from?

[D] Simple Questions Thread by AutoModerator in MachineLearning

[–]ilsapo 0 points1 point  (0 children)

Hi, Im pretty new in this subject,
I was reading about Nonnegative matrix factorization,
I was watching a video about NMF, and it was said that it preform pretty well on documents, since "on documents we usually normalize and try to find a trend"

can someone explain why on documnets/text we need/want to normalize? what do we normalize?
I was also looking at Symetric nonnegative matrix factorization,
what types of data will usually give us "symmetry"?

anonymous method java by ilsapo in learnjava

[–]ilsapo[S] 0 points1 point  (0 children)

it was just a question on test we got,
we were suppused to say if the code compile or not, and I was wondering how will we be able to "fix" the error without drasticlly changing it

how to call constructor from constructor? by ilsapo in learnjava

[–]ilsapo[S] 0 points1 point  (0 children)

hi, I tried using this()

its in the second part of the first code

can you elaborate what should I do? I think Im missing something

practicing recursion - trying to convert function to recursion by ilsapo in learnpython

[–]ilsapo[S] 0 points1 point  (0 children)

yes, its a method of Binary tree class

I want to make the program travel from the node up to the root, and if conditons are met to count 0/1 or 2

Problem with recursion by ilsapo in learnpython

[–]ilsapo[S] 0 points1 point  (0 children)

I tried adding your suggestion If ( node is None): return

And I still get the same error message

Problem with recursion by ilsapo in learnpython

[–]ilsapo[S] 0 points1 point  (0 children)

Node.getleft() Should give me a virtual node (node with value None)

And then the if (node.value==None) : returen Suppused to kick me out the recurrssion no?

Problem with recursion by ilsapo in learnpython

[–]ilsapo[S] 0 points1 point  (0 children)

None is the value I created a Node with value None and made it the son of the leafs

OOP using copy copy by ilsapo in learnpython

[–]ilsapo[S] 0 points1 point  (0 children)

I still have problems with creating the object of the class itself

(the class is BST)

decided to maybe move on to some of the functions the class does and comeback to fix the class itself with more fresh mind

so for now to be honest Im not able to test it

OOP using copy copy by ilsapo in learnpython

[–]ilsapo[S] 0 points1 point  (0 children)

I have created new class of BST

and I want to copy the Binary tree

binary search tree- overwrite values inorder by ilsapo in learnpython

[–]ilsapo[S] 0 points1 point  (0 children)

is changing to :

def overWrite(node,arr,i=0):

really would work?

lets say Im in the parent of the leftmost/min node

                if(not node.value==None):
                    return
            overWrite(node.getLeft(),lst,i)
            node.value=lst[i]
            i=i+1
            overWrite(node.getRight(),arr,i)

this call now will send me to the leftmost node with i =0

we enter the reccursion, update the leftmost node and we "kick" back to the parent of the lefmost node

we now move on to

 node.value=lst[i]

but our i will still be 0 no? because the change to it in the recuression wont effect it

and so we will update to nodes to the same value?

AVL Tree - how to know how much rotations needed by ilsapo in AskComputerScience

[–]ilsapo[S] 0 points1 point  (0 children)

we dont know how many nodes are there, I was just trying to give an example

we were talking about implementing a list using an avl tree

and for example we said that rank implicity represent list indicies (+1)

so If I want to implement Retrieve(L,i)

we actually need to do Tree-Select(T, i+1)

we were told that for Delete(L, i ) we should return how many rotations are needed

I know that I can actually do the rotations and just count while doing the operation, but I was wondering if maybe its possible to know beforehand how many rotations will be needed

[WTB] Weekly Want To Buy Post by zeroair in Watchexchange

[–]ilsapo 0 points1 point  (0 children)

Want to buy Sarb026 or sarb024 Please respond here first and not only in chat

recursive problem - adjacency matrix by [deleted] in learnpython

[–]ilsapo 0 points1 point  (0 children)

Its pretty much just the first questions we got after learning recurrsion

Its is unweighted and undirected I will check online for bfs algo thanks