Login
Register
Dark Mode
Brightness
Ambient Glow – Questions list
Register
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
User neel19
Wall
Recent activity
All questions
All answers
All comments
Exams Taken
Resume
All Blogs
Badges
neel19
100 points
Follow
About
About
@neel19
At peace.
Close
TOP 98.76%
Last seen 3 years ago
Ranked #210
www.linkedin.com
Verification:
Verified Account
Member for:
6 years (since Apr 15, 2020)
Type:
Registered user
Extra privileges:
Asking questions
Flagging posts
Full name:
GATE Year:
2021(3rd year),2022, 2023
GATE Rank:
NQ, 3225, 85
About:
At peace.
Resume:
GitHub Profile Link:
DBLP Link:
Following standard books?:
Home State:
Donate Me Link:
Messages from only those in my circle:
Access Lists
Activity by neel19
Score:
100
points (ranked #
210
)
Title:
Active
Exams Created:
0
Exams Taken:
0
No. of Edits:
0
Posts:
0
Questions:
0
Answers:
0
Comments:
0
Voted on:
0
questions,
0
answers
Gave out:
0
up votes,
0
down votes
Received:
0
up votes,
0
down votes
Reactions received:
0
Network Sites:
Wall for neel19
Please
log in
or
register
to post on this wall.
Awe111
Oct 12, 2021
https://web.stanford.edu/class/archive/cs/cs161/cs161.1168/lecture3.pdf
Awe111
Oct 12, 2021
https://gateoverflow.in/46895/t-n-2t-floor-sqrt-n-log-n
Awe111
Oct 12, 2021
https://gateoverflow.in/247755/can-we-solve-the-recurrence-n-by-masters-theorem-if-possible?show=362719#c362719
Awe111
Oct 12, 2021
T(n)=T(n/2)+logn How to solve this without using masters theorem?
https://gateoverflow.in/247755/can-we-solve-the-recurrence-n-by-masters-theorem-if-possible