DSA 1.2.2.2 Algorithms: Recurrence Relations

girlscript / winter-of-contributing

GirlScript Winter of Contributing is a three-month-long Open-Source Program organized by🧡GirlScript Foundation to create the world's largest multilingual content repository that will be available to everyone.

MIT License

880 stars 1.57k forks source link

DSA 1.2.2.2 Algorithms: Recurrence Relations #483

Closed nimisha-yadav closed 3 years ago

nimisha-yadav commented 3 years ago

Description

Discuss Asymptotic Notations. What are Lower and Upper bounds? Describe their usages.

Task

[ ] Documentation
[ ] Audio
[ ] Video

Note

While requesting the issue to be assigned, please mention your NAME & BATCH NUMBER.
Kindly refer to the Issue Guidelines.
In case you see that the issue has already been assigned, try to request for a different task within the same issue.
Changes should be made inside the DSA/directory & DSA branch.
Name of the file should be same as the issue.
This issue is only for 'GWOC' contributors of 'DSA' Domain.

aman12207 commented 3 years ago

i would like to work on this issue. Aman Gupta

GenMech commented 3 years ago

@nimisha-yadav I have a good hold on Array and i would like to contribute for the same as i see there is no one assigned yet, you can assign me for the same! Gitesh Pareek Batch-1

geeky01adarsh commented 3 years ago

Name: Adarsh Navneet Sinha Batch: DSA batch 2 Type: Documentation I want to work on the documentation of this issue. Please assign the documentation part to me.

nimisha-yadav commented 3 years ago

Name: Adarsh Navneet Sinha Batch: DSA batch 2 Type: Documentation I want to work on the documentation of this issue. Please assign the documentation part to me.

Assigning this issue to you @geeky01adarsh, all the best!

@aman12207 for future issues, do send in your batch number as well according to the guideline.