Created
May 18, 2022 19:07
-
-
Save aslamanver/c0bedcb86de6532e707f4d05830fdc6a to your computer and use it in GitHub Desktop.
Data Structure
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
package org.tillion.aslam.test; | |
class Operations { | |
public static void main(String[] args) { | |
int[] intArr = {5, 4, 3, 8, 9, 11, 3, 3, 2, 9, 8, 7, 1, 22, 15, 67, 4, 17, 54, 67}; | |
for (int j = 0; j < intArr.length - 1; j++) { | |
for (int i = 0; i < intArr.length - 1; i++) { | |
if (intArr[i] > intArr[i + 1]) { | |
int temp = intArr[i + 1]; | |
intArr[i + 1] = intArr[i]; | |
intArr[i] = temp; | |
} | |
} | |
} | |
printArray("Sorted: ", intArr); | |
int target = 9; | |
int left = 0; | |
int right = intArr.length - 1; | |
int result = -1; | |
while (left <= right) { | |
int middle = (left + right) / 2; | |
if (target < intArr[middle]) { | |
right = middle - 1; | |
} else if (target > intArr[middle]) { | |
left = middle + 1; | |
} else { | |
result = middle; | |
break; | |
} | |
} | |
System.out.println("Binary Result: " + result); | |
int[] uniqueArr = new int[0]; | |
for (int i = 0; i < intArr.length; i++) { | |
if (intArr.length > i + 1 && intArr[i] == intArr[i + 1]) continue; | |
int[] tempArray = new int[uniqueArr.length + 1]; | |
for (int s = 0; s < uniqueArr.length; s++) tempArray[s] = uniqueArr[s]; | |
tempArray[tempArray.length - 1] = intArr[i]; | |
uniqueArr = tempArray; | |
} | |
intArr = uniqueArr; | |
printArray("Removed Duplicates: ", intArr); | |
} | |
static void printArray(String title, int[] intArr) { | |
System.out.print(title); | |
for (int i = 0; i < intArr.length; i++) System.out.print(intArr[i] + " "); | |
System.out.println(); | |
} | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment