Stanford-Java2/BusinessList.java at master · TaeSeanDo/Stanford-Java2 · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
/*
 * To change this license header, choose License Headers in Project Properties.
 * To change this template file, choose Tools | Templates
 * and open the template in the editor.
 */
package mergesort;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;

/**
 *
 * @author Education Unlimited
 */
public class BusinessList {

    int numOfBusinesses;
    BusinessRecord[] businessRecords = new BusinessRecord[100];
    int numSearches;
    int numSearchesFailed;

    public BusinessList(String name) throws IOException {
        //Construct BufferedReader from InputStreamReader


        try (BufferedReader reader = new BufferedReader(new FileReader(name))) {
            int numOfBusinesses = Integer.parseInt(reader.readLine());
            for (int i = 0; i < numOfBusinesses; i++) {
                String nextLine = reader.readLine();
                String busName = nextLine.split(", ")[0];
                String phNum = nextLine.split(", ")[1];
                BusinessRecord newBus = new BusinessRecord(name, phNum);
                businessRecords[i] = newBus;


            }
            reader.close();

        } catch (IOException e) {
            e.printStackTrace();
        }

    }

    public void mergeSort() {
        String[] workspace = new String[numOfBusinesses];
        recMergeSort(workspace, 0, numOfBusinesses);
    }

    public void recMergeSort(String[] workspace, int lowerBound, int upperBound) {
        if (lowerBound != upperBound) {
            int midpoint = (upperBound + lowerBound) / 2;//integer division
            recMergeSort(workspace, lowerBound, midpoint);
            recMergeSort(workspace, midpoint + 1, upperBound);
            merge(workspace, lowerBound, midpoint+1, upperBound);
        }

    }

    public void merge(String[] workspace, int lowPointer, int highPointer, int upperBound) {
        int highPointerInit = highPointer;
        int i = 0;
        while (highPointer <= upperBound && lowPointer < highPointerInit){
            if (businessRecords[lowPointer].getName().compareTo(businessRecords[highPointer].getName()) < 0) {
                workspace[i] = businessRecords[lowPointer].getName();
                lowPointer++;
                i++;

            } else {
                workspace[i] = businessRecords[highPointer].getName();
                highPointer++;
                i++;

            }

        }
       while(highPointer > upperBound && lowPointer < highPointerInit) {
           workspace[i] = businessRecords[lowPointer].getName();
           lowPointer++;
           i++;
       }

       while(highPointer <= upperBound && lowPointer >= highPointerInit) {
           workspace[i] = businessRecords[highPointer].getName();
           highPointer++;
           i++;
       }

    }

    public String find(String name) {
        boolean found = false;
        int midpoint;
        while (!found) {

        }
        return null;
    }


    }
//