new semester, new repo structure
This commit is contained in:
@@ -0,0 +1,132 @@
|
||||
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01//EN" "http://www.w3.org/TR/html4/strict.dtd">
|
||||
<html>
|
||||
<head>
|
||||
<title>Lab17_CalebFontenot.java</title>
|
||||
<meta http-equiv="content-type" content="text/html; charset=UTF-8">
|
||||
<style type="text/css">
|
||||
<!--
|
||||
body {color: #a9b7c6; background-color: #2b2b2b; font-family: monospace}
|
||||
pre {color: #a9b7c6; background-color: #2b2b2b; font-family: monospace}
|
||||
table {color: #888888; background-color: #313335; font-family: monospace}
|
||||
.ST5 {color: #9876aa}
|
||||
.number {color: #6897bb}
|
||||
.string {color: #6a8759}
|
||||
.comment {color: #808080}
|
||||
.whitespace {color: #505050}
|
||||
.ST2 {color: #ffc66d; font-family: monospace; font-style: italic}
|
||||
.ST3 {color: #9876aa; font-family: monospace; font-style: italic}
|
||||
.ST1 {color: #808080; font-family: monospace; font-weight: bold}
|
||||
.ST0 {color: #287bde}
|
||||
.literal {color: #cc7832}
|
||||
.ST4 {font-family: monospace; font-style: italic}
|
||||
-->
|
||||
</style>
|
||||
</head>
|
||||
<body>
|
||||
<table width="100%"><tr><td align="center">/home/caleb/ASDV-Java/Assignments/lab17_CalebFontenot/src/main/java/com/calebfontenot/lab17_calebfontenot/Lab17_CalebFontenot.java</td></tr></table>
|
||||
<pre>
|
||||
<span class="comment">/*</span>
|
||||
<span class="comment"> * Click </span><span class="ST0">nbfs://nbhost/SystemFileSystem/Templates/Licenses/license-default.txt</span><span class="comment"> to change this license</span>
|
||||
<span class="comment"> * Click </span><span class="ST0">nbfs://nbhost/SystemFileSystem/Templates/Project/Maven2/JavaApp/src/main/java/$</span><span class="comment">{packagePath}/${mainClassName}.java to edit this template</span>
|
||||
<span class="comment"> */</span>
|
||||
<span class="literal">package</span> com.calebfontenot.lab17_calebfontenot;
|
||||
|
||||
<span class="comment">/**</span>
|
||||
<span class="comment"> *</span>
|
||||
<span class="comment"> * </span><span class="ST1">@author</span> <span class="comment">caleb</span>
|
||||
<span class="comment">*/</span>
|
||||
<span class="literal">public</span> <span class="literal">class</span> Lab17_CalebFontenot {
|
||||
|
||||
<span class="literal">public</span> <span class="literal">static</span> <span class="literal">void</span> <span class="ST2">main</span>(String[] args)
|
||||
{
|
||||
<span class="literal">final</span> <span class="literal">int</span> NUM_TO_SEARCH_FOR = <span class="number">2</span>;
|
||||
<span class="literal">int</span>[] originalArray = <span class="literal">new</span> <span class="literal">int</span>[]{<span class="number">420</span>, <span class="number">41</span>, <span class="number">7</span>, <span class="number">2</span>, <span class="number">26</span>, <span class="number">2243</span>};
|
||||
System.<span class="ST3">out</span>.print(<span class="string">"</span><span class="string">Original array: </span><span class="string">"</span>);
|
||||
<span class="ST4">printArray</span>(originalArray);
|
||||
<span class="ST4">selectionSort</span>(originalArray);
|
||||
System.<span class="ST3">out</span>.print(<span class="string">"</span><span class="string">Sorted array: </span><span class="string">"</span>);
|
||||
<span class="ST4">printArray</span>(originalArray);
|
||||
|
||||
System.<span class="ST3">out</span>.println(<span class="string">"</span><span class="string">Binary Search</span><span class="string">"</span>);
|
||||
System.<span class="ST3">out</span>.println(<span class="string">"</span><span class="string">-----------------------</span><span class="string">"</span>);
|
||||
System.<span class="ST3">out</span>.println(<span class="string">"</span><span class="string">binarySearchWhile() returns: </span><span class="string">"</span> + <span class="ST4">binarySearchWhile</span>(originalArray, NUM_TO_SEARCH_FOR));
|
||||
<span class="ST4">isInArray</span>(<span class="ST4">b</span><span class="ST4">inarySearchWhile</span>(originalArray, NUM_TO_SEARCH_FOR), NUM_TO_SEARCH_FOR);
|
||||
|
||||
System.<span class="ST3">out</span>.println(<span class="string">"</span><span class="string">binarySearchFor() returns: </span><span class="string">"</span> + <span class="ST4">binarySearchFor</span>(originalArray, NUM_TO_SEARCH_FOR));
|
||||
<span class="ST4">isInArray</span>(<span class="ST4">b</span><span class="ST4">inarySearchFor</span>(originalArray, NUM_TO_SEARCH_FOR), NUM_TO_SEARCH_FOR);
|
||||
|
||||
}
|
||||
|
||||
<span class="literal">public</span> <span class="literal">static</span> <span class="literal">void</span> <span class="ST2">isInArray</span>(<span class="literal">int</span> arrayResult, <span class="literal">int</span> searchQuery)
|
||||
{
|
||||
<span class="literal">if</span> (arrayResult == <span class="number">0</span>) {
|
||||
System.<span class="ST3">out</span>.println(searchQuery + <span class="string">"</span><span class="string"> is in the array.</span><span class="string">"</span>);
|
||||
} <span class="literal">else</span> {
|
||||
System.<span class="ST3">out</span>.println(searchQuery + <span class="string">"</span><span class="string"> is not in the array.</span><span class="string">"</span>);
|
||||
}
|
||||
}
|
||||
|
||||
<span class="literal">public</span> <span class="literal">static</span> <span class="literal">int</span>[] <span class="ST2">selectionSort</span>(<span class="literal">int</span>[] arr)
|
||||
{
|
||||
<span class="comment">// Sort an array by comparing each and every item in the array and swapping them if they are less than the following number</span>
|
||||
<span class="literal">for</span> (<span class="literal">int</span> i = <span class="number">0</span>; i < arr.<span class="ST5">length</span> - <span class="number">1</span>; ++i) {
|
||||
<span class="literal">for</span> (<span class="literal">int</span> j = i; j < arr.<span class="ST5">length</span>; ++j) {
|
||||
<span class="literal">if</span> (arr[i] > arr[j]) {
|
||||
<span class="literal">int</span> temp = arr[i];
|
||||
arr[i] = arr[j];
|
||||
arr[j] = temp;
|
||||
}
|
||||
}
|
||||
}
|
||||
<span class="literal">return</span> arr;
|
||||
}
|
||||
|
||||
<span class="literal">public</span> <span class="literal">static</span> <span class="literal">void</span> <span class="ST2">printArray</span>(<span class="literal">int</span>[] arr)
|
||||
{
|
||||
<span class="literal">for</span> (<span class="literal">int</span> i : arr) {
|
||||
System.<span class="ST3">out</span>.print(i + <span class="string">"</span> <span class="string">"</span>);
|
||||
}
|
||||
System.<span class="ST3">out</span>.println();
|
||||
}
|
||||
|
||||
<span class="comment">//replace fors with whiles</span>
|
||||
<span class="literal">public</span> <span class="literal">static</span> <span class="literal">int</span> <span class="ST2">binarySearchWhile</span>(<span class="literal">int</span>[] ar, <span class="literal">int</span> key)
|
||||
{
|
||||
<span class="literal">int</span> low = <span class="number">0</span>;
|
||||
<span class="literal">int</span> high = ar.<span class="ST5">length</span> - <span class="number">1</span>;
|
||||
<span class="literal">while</span> (high >= low) {
|
||||
<span class="literal">int</span> mid = (low + high) / <span class="number">2</span>;
|
||||
<span class="literal">if</span> (key < ar[mid]) {
|
||||
high = mid - <span class="number">1</span>;
|
||||
} <span class="literal">else</span> <span class="literal">if</span> (key == ar[mid]) {
|
||||
<span class="literal">return</span> mid;
|
||||
} <span class="literal">else</span> {
|
||||
low = mid + <span class="number">1</span>;
|
||||
}
|
||||
}
|
||||
<span class="literal">return</span> <span class="number">1</span>;
|
||||
|
||||
}
|
||||
<span class="comment">//replace while with for</span>
|
||||
|
||||
<span class="literal">public</span> <span class="literal">static</span> <span class="literal">int</span> <span class="ST2">binarySearchFor</span>(<span class="literal">int</span>[] ar, <span class="literal">int</span> key)
|
||||
{
|
||||
<span class="literal">int</span> low = <span class="number">0</span>;
|
||||
<span class="literal">int</span> high = ar.<span class="ST5">length</span> - <span class="number">1</span>;
|
||||
<span class="literal">for</span> (low = <span class="number">0</span>; high >= low;) {
|
||||
<span class="literal">int</span> mid = (low + high) / <span class="number">2</span>;
|
||||
<span class="literal">if</span> (key < ar[mid]) {
|
||||
high = mid - <span class="number">1</span>;
|
||||
} <span class="literal">else</span> <span class="literal">if</span> (key == ar[mid]) {
|
||||
<span class="literal">return</span> mid;
|
||||
} <span class="literal">else</span> {
|
||||
low = mid + <span class="number">1</span>;
|
||||
}
|
||||
}
|
||||
<span class="literal">return</span> <span class="number">1</span>;
|
||||
}
|
||||
|
||||
}
|
||||
|
||||
</pre></body>
|
||||
</html>
|
||||
14
Semester 1/Assignments/lab17_CalebFontenot/pom.xml
Normal file
14
Semester 1/Assignments/lab17_CalebFontenot/pom.xml
Normal file
@@ -0,0 +1,14 @@
|
||||
<?xml version="1.0" encoding="UTF-8"?>
|
||||
<project xmlns="http://maven.apache.org/POM/4.0.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://maven.apache.org/POM/4.0.0 http://maven.apache.org/xsd/maven-4.0.0.xsd">
|
||||
<modelVersion>4.0.0</modelVersion>
|
||||
<groupId>com.calebfontenot</groupId>
|
||||
<artifactId>lab17_CalebFontenot</artifactId>
|
||||
<version>1.0-SNAPSHOT</version>
|
||||
<packaging>jar</packaging>
|
||||
<properties>
|
||||
<project.build.sourceEncoding>UTF-8</project.build.sourceEncoding>
|
||||
<maven.compiler.source>18</maven.compiler.source>
|
||||
<maven.compiler.target>18</maven.compiler.target>
|
||||
<exec.mainClass>com.calebfontenot.lab17_calebfontenot.Lab17_CalebFontenot</exec.mainClass>
|
||||
</properties>
|
||||
</project>
|
||||
@@ -0,0 +1,102 @@
|
||||
/*
|
||||
* Click nbfs://nbhost/SystemFileSystem/Templates/Licenses/license-default.txt to change this license
|
||||
* Click nbfs://nbhost/SystemFileSystem/Templates/Project/Maven2/JavaApp/src/main/java/${packagePath}/${mainClassName}.java to edit this template
|
||||
*/
|
||||
package com.calebfontenot.lab17_calebfontenot;
|
||||
|
||||
/**
|
||||
*
|
||||
* @author caleb
|
||||
*/
|
||||
public class Lab17_CalebFontenot {
|
||||
|
||||
public static void main(String[] args)
|
||||
{
|
||||
final int NUM_TO_SEARCH_FOR = 2;
|
||||
int[] originalArray = new int[]{420, 41, 7, 2, 26, 2243};
|
||||
System.out.print("Original array: ");
|
||||
printArray(originalArray);
|
||||
selectionSort(originalArray);
|
||||
System.out.print("Sorted array: ");
|
||||
printArray(originalArray);
|
||||
|
||||
System.out.println("Binary Search");
|
||||
System.out.println("-----------------------");
|
||||
System.out.println("binarySearchWhile() returns: " + binarySearchWhile(originalArray, NUM_TO_SEARCH_FOR));
|
||||
isInArray(binarySearchWhile(originalArray, NUM_TO_SEARCH_FOR), NUM_TO_SEARCH_FOR);
|
||||
|
||||
System.out.println("binarySearchFor() returns: " + binarySearchFor(originalArray, NUM_TO_SEARCH_FOR));
|
||||
isInArray(binarySearchFor(originalArray, NUM_TO_SEARCH_FOR), NUM_TO_SEARCH_FOR);
|
||||
|
||||
}
|
||||
|
||||
public static void isInArray(int arrayResult, int searchQuery)
|
||||
{
|
||||
if (arrayResult == 0) {
|
||||
System.out.println(searchQuery + " is in the array.");
|
||||
} else {
|
||||
System.out.println(searchQuery + " is not in the array.");
|
||||
}
|
||||
}
|
||||
|
||||
public static int[] selectionSort(int[] arr)
|
||||
{
|
||||
// Sort an array by comparing each and every item in the array and swapping them if they are less than the following number
|
||||
for (int i = 0; i < arr.length - 1; ++i) {
|
||||
for (int j = i; j < arr.length; ++j) {
|
||||
if (arr[i] > arr[j]) {
|
||||
int temp = arr[i];
|
||||
arr[i] = arr[j];
|
||||
arr[j] = temp;
|
||||
}
|
||||
}
|
||||
}
|
||||
return arr;
|
||||
}
|
||||
|
||||
public static void printArray(int[] arr)
|
||||
{
|
||||
for (int i : arr) {
|
||||
System.out.print(i + " ");
|
||||
}
|
||||
System.out.println();
|
||||
}
|
||||
|
||||
//replace fors with whiles
|
||||
public static int binarySearchWhile(int[] ar, int key)
|
||||
{
|
||||
int low = 0;
|
||||
int high = ar.length - 1;
|
||||
while (high >= low) {
|
||||
int mid = (low + high) / 2;
|
||||
if (key < ar[mid]) {
|
||||
high = mid - 1;
|
||||
} else if (key == ar[mid]) {
|
||||
return mid;
|
||||
} else {
|
||||
low = mid + 1;
|
||||
}
|
||||
}
|
||||
return 1;
|
||||
|
||||
}
|
||||
//replace while with for
|
||||
|
||||
public static int binarySearchFor(int[] ar, int key)
|
||||
{
|
||||
int low = 0;
|
||||
int high = ar.length - 1;
|
||||
for (low = 0; high >= low;) {
|
||||
int mid = (low + high) / 2;
|
||||
if (key < ar[mid]) {
|
||||
high = mid - 1;
|
||||
} else if (key == ar[mid]) {
|
||||
return mid;
|
||||
} else {
|
||||
low = mid + 1;
|
||||
}
|
||||
}
|
||||
return 1;
|
||||
}
|
||||
|
||||
}
|
||||
Reference in New Issue
Block a user