INTRODUCTION This is a hand-in written by GROUP 7 (FIRE) for the Algorithms course (TIN092) at Chalmers University of Technology. Group 7 consists of: - MAZDAK FARROKHZAD - 901011-0279 - [email protected] - Program: IT - NICLAS ALEXANDERSSON - 920203-0111 - [email protected] - Program: IT

INTRODUCTION This is a hand-in written by GROUP 7 (FIRE) for the Algorithms course (TIN092) at Chalmers University of Technology. Group 7 consists of: - MAZDAK FARROKHZAD - 901011-0279 - [email protected] - Program: IT - NICLAS ALEXANDERSSON - 920203-0111 - [email protected] - Program: IT

INTRODUCTION This is a hand-in written by GROUP 7 (FIRE) for the Algorithms course (TIN092) at Chalmers University of Technology. Group 7 consists of: - MAZDAK FARROKHZAD - 901011-0279 - [email protected] - Program: IT - NICLAS ALEXANDERSSON - 920203-0111 - [email protected] - Program: IT

INTRODUCTION This is a hand-in written by GROUP 7 (FIRE) for the Algorithms course (TIN092) at Chalmers University of Technology. Group 7 consists of: - MAZDAK FARROKHZAD - 901011-0279 - [email protected] - Program: IT - NICLAS ALEXANDERSSON - 920203-0111 - [email protected] - Program: IT

INTRODUCTION This is a hand-in written by GROUP 7 (FIRE) for the Algorithms course (TIN092) at Chalmers University of Technology. Group 7 consists of: - MAZDAK FARROKHZAD - 901011-0279 - [email protected] - Program: IT - NICLAS ALEXANDERSSON - 920203-0111 - [email protected] - Program: IT

INTRODUCTION This is a hand-in written by GROUP 7 (FIRE) for the Algorithms course (TIN092) at Chalmers University of Technology. Group 7 consists of: - MAZDAK FARROKHZAD - 901011-0279 - [email protected] - Program: IT - NICLAS ALEXANDERSSON - 920203-0111 - [email protected] - Program: IT This problem deals with complexity analysis of a recursive algorithm to rotate the pixels of a bitmap. The algorithm uses a low level operation called a blit, which copies one rectangular chunk of pixels from one location to another. The algorithm works by splitting the bitmap into four sections of equal size, using a sequence of five blits to move the sections into their right place, then recursively rotating each section in the same manner. function rotate(s) begin if side length of s > 1 then split s into 4 sections blit sections into place for each section loop rotate(section) end loop end if end

INTRODUCTION This is a hand-in written by GROUP 7 (FIRE) for the Algorithms course (TIN092) at Chalmers University of Technology. Group 7 consists of: - MAZDAK FARROKHZAD - 901011-0279 - [email protected] - Program: IT - NICLAS ALEXANDERSSON - 920203-0111 - [email protected] - Program: IT This hand in deals with complexity analysis of an algorithm prime(n), that works as follows: prime: array [1..n] of boolean = all true for p in 2..sqrt(n) loop if prime[p] then m = p*p while m <= n loop prime[m] = false m = m+p end loop end if end loop

ABOUT This is a hand-in written by MAZDAK FARROKHZAD and NICLAS ALEXANDERSSON in GROUP 28 for the 3rd assignment on Lab1. The assignment is about analysing an algorithm written in 3 different ways where all of them are functionally equivalent. The methods are available in the appendix. The analysis consists of: a. Description of what the algorithm does b. Complexity analysis c. Testing and numerical analysis