---
# System prepended metadata

title: Group 1

---

# Group 1 

# Week 3 - Sorting and Searching

## Team

Team name: Group 3
Date: 3/1/2021

Members

| Role                                                                                                                                                                          | Name |
|-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|------|
| **Facilitator** keeps track of time, assigns tasks and makes sure all the group members are heard and that decisions are agreed upon.                                             |      |
| **Spokesperson** communicates group’s questions and problems to the teacher and talks to other teams; presents the group’s findings.                                              |   Mihhail   |
| **Reflector** observes and assesses the interactions and performance among team members. Provides positive feedback and intervenes with suggestions to improve groups’ processes. |      |
| **Recorder** guides consensus building in the group by recording answers to questions. Collects important information and data.                                                   |      |

## Activities

### Activity 1: Purpose of sorted lists

Record your answer here

### Activity 2: Explanation of selection sort

Record your answer here


### Activity 3: Performance of selection sort

Record your answer here


### Activity 4: Implement selection sort

Record your answer here

### Activity 5: Explanation of merge sort

Record your answer here

### Activity 6: Merge sort - step by step

Record your answer here

### Activity 7: Implement the merge function

And that's how you insert code blocks:

```c=

double *number = malloc(sizeof(double));


```

### Activity 8: Implement the divide-and-conquer algorithm

### Activity 9: Test merge sort

### Activity 10: Binary search - step by step

### Activity 11: Implement binary search

### Activity 12: Test binary search

### Activity 13: Time complexity

### Activity 14: Compare merge sort and selection sort


### Activity 15: Compare naive search and binary search

## Look back

### What we've learnt

Fill in...

### What were the surprises

Fill in...

### What problems we've encountered

Fill in...

### What was or still is unclear

Fill in...

### How did the group perform?

How was the collaboration? What were the reasons for hick-ups? What worked well? What can be improved next time?



