This repository has been archived by the owner on Jul 10, 2024. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 170
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Co-authored-by: Riyazul555 <riyazulislam2003@gmail.com>
- Loading branch information
1 parent
baa14e3
commit 79034b9
Showing
1 changed file
with
44 additions
and
0 deletions.
There are no files selected for viewing
44 changes: 44 additions & 0 deletions
44
program/program/implement-ternary-search/implementTernarySearch.scala
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
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,44 @@ | ||
object TernarySearch { | ||
def ternarySearch(array: Array[Int], value: Int): Int = { | ||
var left = 0 | ||
var right = array.length - 1 | ||
|
||
while (left <= right) { | ||
val partitionSize = (right - left) / 3 | ||
val mid1 = left + partitionSize | ||
val mid2 = right - partitionSize | ||
|
||
if (array(mid1) == value) { | ||
return mid1 | ||
} | ||
|
||
if (array(mid2) == value) { | ||
return mid2 | ||
} | ||
|
||
if (value < array(mid1)) { | ||
right = mid1 - 1 | ||
} else if (value > array(mid2)) { | ||
left = mid2 + 1 | ||
} else { | ||
left = mid1 + 1 | ||
right = mid2 - 1 | ||
} | ||
} | ||
|
||
-1 | ||
} | ||
|
||
def main(args: Array[String]): Unit = { | ||
val sortedArray = Array(1, 2, 3, 4, 5, 6, 7, 8, 9, 10) | ||
val valueToSearch = 7 | ||
|
||
val result = ternarySearch(sortedArray, valueToSearch) | ||
|
||
if (result != -1) { | ||
println(s"Element found at index $result") | ||
} else { | ||
println("Element not found in the array") | ||
} | ||
} | ||
} |