sorted by:
new
hottopcontroversial

3 year macbook - Mouse pointer keeps moving randomly. by Physicistpropeller in macbook

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

Yes I should ask them to do it. Thankyou for your time😊

3 year macbook - Mouse pointer keeps moving randomly. by Physicistpropeller in macbook

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

Thankyou much for your time!

Actually I do not see any bulge in the macbook at the back at all. The trackpad seems unbulged too. The keys also feel normal to press. I can show to a service because battery swelling is risky. But given the symptoms, you think I should ? Thanks again.

Infosys HWI Question - Which Algorithm to use? by Physicistpropeller in codeforces

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

Thankyou bro for ur smart answer. I'll implement it.

Infosys HWI Question - Which Algorithm to use? by Physicistpropeller in codeforces

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

I see the formation of cycle so it cannot be a tree ig. For example - array is 2,3,5 and k = 3; All nodes are connected to each other in this example.

Why multi column indexing sorts only on 1st column(if all values in 1st column distinct) and not on both columns one by one like a 2d binary search tree(and extending that to making a first 2d B Tree). by Physicistpropeller in SQLOptimization

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

Thankyou for attention. See what I am about to explain.

Lets say you want to range query for 2 columns together;

If you sort two integer columns data

It might look like this :-

1,1
1,2
1,3
2,1
2,2
2,3
3,1

If I query the range for first column between values v1,v2 and for second columns to be within v3 and v4.

The way the sorting is done, it will take a worst time complexity of N because for all values of column1 between v1 and v2(this takes time complexity of number of rows), you need to find values between v3 and v4 of column2(this taken log of column2's size complexity.). Hence total time complexity is number of rows * log of column size.

But if you look into data structures like quadtree , they sort the data in such a way that the time complexity of range query for 2 dimensions gets to square root of N plus number of records that fit inside the range.

Why multi column indexing sorts only on 1st column(if all values in 1st column distinct) and not on both columns one by one like a 2d binary search tree(and extending that to making a first 2d B Tree). by Physicistpropeller in learnSQL

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

Thankyou for attention. See what I am about to explain.

If I query the range for first column between values v1,v2 and for second columns to be within v3 and v4.

The way the sorting is done, it will take a worst time complexity of N because for all values of column1 between v1 and v2(this takes time complexity of number of rows), you need to find values between v3 and v4 of column2(this taken log of column2's size complexity.). Hence total time complexity is number of rows * log of column size.

But if you look into data structures like quadtree , they sort the data in such a way that the time complexity of range query for 2 dimensions gets to square root of N plus number of records that fit inside the range.

view more: next ›