new semester, new repo structure

This commit is contained in:
2023-01-10 11:59:05 -06:00
parent 0a76658f85
commit ba6de6e18e
725 changed files with 1199 additions and 103 deletions

View File

@@ -0,0 +1,14 @@
package lab13_calebfontenot;
public class Bug1 {
public static void main(String[] args)
{
int count = 1;
while (count < 100) {
System.out.println("count: " + count);
count *= 2;
}
}
}

View File

@@ -0,0 +1,54 @@
/*
* 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 lab13_calebfontenot;
import java.util.Scanner;
/**
*
* @author ASDV2
*/
public class Bug2
{
public static void main(String[] args)
{
Scanner in = new Scanner(System.in);
int decimalNumber;
String binaryNumber;
System.out.print("Enter a positive integer: ");
decimalNumber = in.nextInt();
int x = 0;
if (decimalNumber <= 0)
System.out.println("ERROR: entered integer is nonpositive.");
else {
binaryNumber = "";
// algorithm step by step
// initial: binaryNumber = "", decimalNumber = 123
// step 1 : binaryNumber = "1 ", decimalNumber = 61
// step 2 : binaryNumber = "11 ", decimalNumber = 30
// step 3 : binaryNumber = "011 ", decimalNumber = 15
// step 4 : binaryNumber = "1011 ", decimalNumber = 7
// step 5 : binaryNumber = "1 1011 ", decimalNumber = 3
// step 6 : binaryNumber = "11 1011 ", decimalNumber = 1
// step 6 : binaryNumber = "111 1011 ", decimalNumber = 0
// stop : (decimalNumber != x)
while (decimalNumber != x)
{
//> add spaces to separate 4-digit groups
if (binaryNumber.length() % 5 == 0)
binaryNumber = " " + binaryNumber;
//> extract last digit in binary representation
// and add it to binaryNumber
binaryNumber = (decimalNumber % 2) + binaryNumber;
//> cut last digit in binary representation
decimalNumber /= 2;
}
System.out.println("Binary: " + binaryNumber);
}
}
}