Lab Assignment 1 Solution

$30.00

Description

Goal:

Implementation of mergesort using linked list ideas.

Requirements:

  1. Write a program to read an input sequence and then produce an array of links giving the values in ascending order. The first line of the input file is the length of the sequence (n) and each of the remaining n lines is a non-negative integer. The first line of the output indicates the subscript of the smallest input value. Each of the remaining output lines is a triple consisting of a subscript along with the corresponding input sequence and link values.

  1. Submit your C program on Blackboard by 12:45 p.m. on June 28. One of the comment lines should include the compilation command used on OMEGA.

Getting Started:

  1. Your program should read the input files by using Unix shell redirection (e.g. a.out<lab1.dat) to read the input from stdin (C). By using redirection, it is unnecessary to open and close the input file, nor should your program prompt for a file name. You should dynamically allocate tables for storing the input and the table of links. Unlike the mergesort in Notes 1 and CLRS, the keys are never copied.

  1. The link values are not initialized before the recursive mergesort begins. Each link will be initialized to -1 when its sequence value is placed in a single-element list (at the bottom of the recursion’s “tree”).

  1. The input sequence array and the link array may be global. Under this assumption, the following prototype may be used: int mergeSort(int start,int count)

where start is the first subscript for a subarray of count elements. The returned int is the subscript of the first element in the resulting sorted sublist. The last element in the sublist will have a link value of -1.

  1. The critical part of the code is a merge of two subarrays that previously had their link values set for ordered sublists. The merge will revise the link values to give a single ordered list.

  1. If an input value appears more than once, those elements should be ordered by subscripts in the final list, i.e. your sort code will be stable.

6. Consider the following input file:

The output will be:

8

First element is at subscript 4

3

0

3

5

5

1

5

2

6

2

6

3

7

3

7

-1

0

4

0

6

4

5

4

1

1

6

1

7

2

7

2

0

Notice that the input sequence ordering has not changed.

First

element

is at subscript

4

0

1

2

3

4

5

6

7

3

5

6

7

0

4

1

2

5

2

3

-1

6

1

7

0

First

element

is at subscript 0

First

element

is at subscript 4

0

1

2

3

4

5

6

7

3

5

6

7

0

4

1

2

1

2

3

-1

6

-1

7

5

First element is at subscript 0

First element is at subscript 2

First element is at subscript 4

First element is at subscript 6

0

1

2

3

4

5

6

7

3

5

6

7

0

4

1

2

1

-1

3

-1

5

-1

7

-1

0

1

2

3

4

5

6

7

3

5

6

7

0

4

1

2

-1

-1

-1

-1

-1

-1

-1

-1


error: Content is protected !!