Finally, the merge sort method involves dividing everything into multiple piles. Each pile should be sorted from A to Z. Then, these piles should be merged.
581
1.72K reads
CURATED FROM
IDEAS CURATED BY
Compelling and entertaining, Algorithms to Live By is packed with practical advice about how to use time, space, and effort more efficiently. And it's a fascinating exploration of the workings of computer science and the human mind
“
The idea is part of this collection:
Learn more about computerscience with this collection
How to practice effectively
The importance of consistency
How to immerse yourself in the language
Related collections
Similar ideas to 3. Merge Sort
Create a topic of your research assignment along with the subtopics labeled as A, B, C, D etc. Each topic can now be a different pile, separated with the help of sticky notes.
Now sort all your papers according to the piles, and when they are complete, start to label each piece of research...
Use your bedroom floor to make piles of all the papers, dividing them into different segments or chapters.
Some of them will overlap into multiple segments and that can also be taken care of. After the segmentation, kindly assign a number to each paper.
Read & Learn
20x Faster
without
deepstash
with
deepstash
with
deepstash
Personalized microlearning
—
100+ Learning Journeys
—
Access to 200,000+ ideas
—
Access to the mobile app
—
Unlimited idea saving
—
—
Unlimited history
—
—
Unlimited listening to ideas
—
—
Downloading & offline access
—
—
Supercharge your mind with one idea per day
Enter your email and spend 1 minute every day to learn something new.
I agree to receive email updates