Re: [Tutor] Lists+sorting

2016-01-04 Thread Pooja Bhalode
Hi, Yes, I tried sending the mail again in plain text. But I think I understood the difference there in using built-in sort function and writing the code without using that. Thank you On Mon, Jan 4, 2016 at 12:45 PM, Joel Goldstick wrote: > On Mon, Jan 4, 2016 at 12:27 PM, Alan Gauld > wrote

Re: [Tutor] Lists+sorting

2016-01-04 Thread Joel Goldstick
On Mon, Jan 4, 2016 at 12:27 PM, Alan Gauld wrote: > On 04/01/16 16:56, Pooja Bhalode wrote: > > Hi, > > I wanted to check if I can write the following program in this manner as > > well. > > > > Can you resend in plain text please? > Your post lost all its formatting so its hard to read > or com

Re: [Tutor] Lists+sorting

2016-01-04 Thread Alan Gauld
On 04/01/16 16:56, Pooja Bhalode wrote: > Hi, > I wanted to check if I can write the following program in this manner as > well. > Can you resend in plain text please? Your post lost all its formatting so its hard to read or comment on. > def linear_merge(list1, list2): > result = [] > while len

[Tutor] Lists+sorting

2016-01-04 Thread Pooja Bhalode
Hi, I wanted to check if I can write the following program in this manner as well. The problem is to merge the lists together and sort them.The solution they have given is: def linear_merge(list1, list2): result = [] while len(list1) and len(list2): if list1[0] < list2[0]: result.append(list