answer:I don’t know Scheme at all. Logically I’d say; Sort the list. If the number of items is odd, the median will be in the middle position. (middle position for an odd number would be ((NumInList – 1 ) / 2 ) + 1 for an even number the median is the two middle positions averaged together. Something like : sort list. if (numInList odd) >> median =( ( numInList -1 ) / 2 ) + 1 else ( numList even) >> median = ( list[ numlist/2 -1 ] + list[numlist/2] ) / 2 where list[n] lets you access the nth position in the list and numList is the number in the list. (note the positions for the even number list may vary depending on whether your list starts at position 0 or 1) Don’t know how to translate this into Scheme, but I hope this helped!