This programming assignment is to implement and compare the following sorting al
ID: 3598549 • Letter: T
Question
This programming assignment is to implement and compare the following sorting algorithms on arrays of integers, using either Java or C++.
1.Insertionsort
2.quicksort (recursive version ) use the right-most element as pivot
3.quicksort (recursive version ), use the right-most element as pivot and switch to insertion sort when size of array is less than certain predetermined integer -- the cutoff size
4.Quicksort2 (recursive version ) , use the median of three as the pivot element.
5.mergesort recursive
6.Heapsort
You must submit the following:
All the source codes
Your source code must be well-documented.
Documentation that describes what you did, and how to run your program
Explanation / Answer
package com.one;
public class X00000000 extends Polynomial {
public static void main(String args[]) throws Exception {
Polynomial p = new X00000000(" X^5"), q = new X00000000("X^2 - X + 1");
Utility.run(p, q);
}
public X00000000(String s) {
// parse string character by character
double coef = 0; // coefficient of term
int deg = 0; // degree of term
String[] terms = s.split(" ");
for (int i = 0; i < terms.length; i++) {
String term = terms[i];
// System.out.println("term:"+term);
String prevTerm = "";
if (i != 0)
prevTerm = terms[i - 1];
if (term.startsWith("X")) {
if (term.length() == 3 && term.contains("^")) {
coef = 1;
deg = Integer.parseInt(term.substring(2));
} else if (term.length() == 1) {
deg = 1;
if (prevTerm.equals("-"))
coef = -1;
else
coef = 1;
}
} else if (term.startsWith("-") || term.startsWith("+"))
continue;
else if (term.length() == 1 && Character.isDigit(term.charAt(0))) {
coef = Integer.parseInt(term);
if (prevTerm.equals("-"))
coef *= -1;
deg = 0;
}
Term T = new Term(coef, deg);
if (data.isEmpty()) {
data.addFirst(T);
} else {
data.addLast(T);
}
}
}
public X00000000() {
super();
}
public Polynomial add(Polynomial p) {
Polynomial ans = new X00000000();
// complete this code
return ans;
}
public Polynomial subtract(Polynomial p) {
Polynomial ans = new X00000000();
// complete this code
return ans;
}
public Polynomial multiply(Polynomial p) {
Polynomial ans = new X00000000();
// complete this code
return ans;
}
public Polynomial divide(Polynomial p) throws Exception {
Polynomial ans = new X00000000();
// complete this code
return ans;
}
public Polynomial remainder(Polynomial p) throws Exception {
Polynomial ans = new X00000000();
// complete this code
return ans;
}
}
Related Questions
drjack9650@gmail.com
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.