## Ex 5, Task 6

tzeenie
Mausschubser
Beiträge: 80
Registriert: 14. Okt 2008 20:04

### Ex 5, Task 6

Has something been said during the exercise about short-hands or notation for the computation trace in task 6? Or are we really supposed to write 100+ lines of repeating fragments of code? I've started from scratch for the third time now, either because I messed up my indendation or made a copy n paste mistake somewhere or the like.
This is really tiresome...

sproksch
Computerversteher
Beiträge: 346
Registriert: 15. Apr 2004 17:56

### Re: Ex 5, Task 6

Same Problem here... 151 lines of code so far, but I'm sure there are still bracket errors in there. Perhaps we misinterpreted the task, or there is simply a shorter way to write it down...

Are we allowed to shorten the computation of merge?

sewe
Sonntagsinformatiker
Beiträge: 295
Registriert: 16. Jan 2009 14:53
Kontaktdaten:

### Re: Ex 5, Task 6

@tzeenie: Yes, if the same pattern occurs over and over again, replacing stuff with an ellipsis is fine. (In hindsight, using a shorter list may have been sufficient. )

Alp.traum
Mausschubser
Beiträge: 85
Registriert: 3. Feb 2004 15:15
Kontaktdaten:

### Re: Ex 5, Task 6

Hm, i don't know if i made a mistake here, but i have only 30 lines of stacktrace code, and i don't think that i missed steps between them. Is that possible?

kde
BASIC-Programmierer
Beiträge: 123
Registriert: 19. Dez 2006 10:29
Kontaktdaten:

### Re: Ex 5, Task 6

hey,
do we need to trace the take, drop and length calls or can we just omit them. E.q. is (mSort [1,2,3]) resulting in (merge (mSort [1]) (mSort [2,3])) sufficient in a single trace step?
Tutor in SE: Design (& Construction) SS 2011