Welcome to the Treehouse Community

Want to collaborate on code errors? Have bugs you need feedback on? Looking for an extra set of eyes on your latest project? Get support with fellow developers, designers, and programmers of all backgrounds and skill levels here with the Treehouse Community! While you're at it, check out some resources Treehouse students have shared here.

Looking to learn something new?

Treehouse offers a seven day free trial for new students. Get access to thousands of hours of content and join thousands of Treehouse students and alumni in the community today.

Start your free trial

Computer Science Introduction to Data Structures The Merge Sort Algorithm Evaluating the Runtime of Merge Sort

Gerald Bishop
seal-mask
.a{fill-rule:evenodd;}techdegree seal-36
Gerald Bishop
Python Development Techdegree Graduate 16,897 Points

How to split the list using an iterative approach without using slicing? (3:35 in video)

In the video around 3:35, the teacher suggests implementing the split into two lists without using Python's slicing operator. I've looked at the video for iterative Binary Search and cannot figure out how to apply using the first and last variables to create a split and avoid using slice.

The teacher suggests there are teachers notes but they seems to have been removed and implementation in the next lesson is in Swift only.

1 Answer

Steven Parker
Steven Parker
230,231 Points

He's not suggesting implementing the split without slicing. What he is suggesting is to implement merge_sort using an iterative approach without using list slicing, which would mean removing the split function entirely.

I does look like you've discovered a bug in the video regarding the missing notes mentioned at 3:51 in the video. You may want to report this to Support, it should get you a "special Exterminator badge" if you're the first to point it out. :beetle: