The problem set is individual. You may discuss it in general terms, but don't look at each other's code. Significant help from others must be acknowledged.
Write a program that declares three integers (n1, n2, and n3) and then print them in order (the smallest one first). Make sure that your program works for all possible initial orderings. Assume that all three integers are different. Write down in comments what data you used to test your program.
Write a program that prints a string backward in a loop.
Write a program to find the number of occurrences of a given substring in a string. Use indexOf method in a loop (what is the return value of indexOf when the substring is not found?). Print the result only once, after the loop. Show your test data.
Write a program that simulates a roll of a six-sided die and repeats the rolls (in a loop) until the sum of the results exceeds 20. The program must print out all the results of rolls and the running sum.
Submit your Java file(s) to me by e-mail. The subject must be Problem Set N, where N is the problem set number.