aboutsummaryrefslogtreecommitdiff
path: root/src/sort
diff options
context:
space:
mode:
authorRabin Gaire <rabingaire20@gmail.com>2020-12-06 23:17:20 +0545
committerEmmanuel Odeke <emmanuel@orijtech.com>2021-03-18 08:25:24 +0000
commit732ea4c2dcc1bcbcff65c31047ebb54364e7865d (patch)
treebf7a7f2cf25959b8be588b02edf3fe18a1b7315c /src/sort
parentc2d625168fd636a390e1e69b10c7f3c98569ded8 (diff)
downloadgo-732ea4c2dcc1bcbcff65c31047ebb54364e7865d.tar.gz
go-732ea4c2dcc1bcbcff65c31047ebb54364e7865d.zip
sort: add example tests for SearchFloat64s and SearchInts
Change-Id: I5fa4773467e3f515250deead72fdce3e4bd0973b Reviewed-on: https://go-review.googlesource.com/c/go/+/275457 Reviewed-by: Emmanuel Odeke <emmanuel@orijtech.com> Reviewed-by: Robert Griesemer <gri@golang.org> Run-TryBot: Emmanuel Odeke <emmanuel@orijtech.com> TryBot-Result: Go Bot <gobot@golang.org> Trust: Robert Griesemer <gri@golang.org>
Diffstat (limited to 'src/sort')
-rw-r--r--src/sort/example_search_test.go32
1 files changed, 32 insertions, 0 deletions
diff --git a/src/sort/example_search_test.go b/src/sort/example_search_test.go
index 6928f0f092..856422a385 100644
--- a/src/sort/example_search_test.go
+++ b/src/sort/example_search_test.go
@@ -40,3 +40,35 @@ func ExampleSearch_descendingOrder() {
// Output:
// found 6 at index 7 in [55 45 36 28 21 15 10 6 3 1]
}
+
+// This example demonstrates searching for float64 in a list sorted in ascending order.
+func ExampleSearchFloat64s() {
+ a := []float64{1.0, 2.0, 3.3, 4.6, 6.1, 7.2, 8.0}
+
+ x := 2.0
+ i := sort.SearchFloat64s(a, x)
+ fmt.Printf("found %g at index %d in %v\n", x, i, a)
+
+ x = 0.5
+ i = sort.SearchFloat64s(a, x)
+ fmt.Printf("%g not found, can be inserted at index %d in %v\n", x, i, a)
+ // Output:
+ // found 2 at index 1 in [1 2 3.3 4.6 6.1 7.2 8]
+ // 0.5 not found, can be inserted at index 0 in [1 2 3.3 4.6 6.1 7.2 8]
+}
+
+// This example demonstrates searching for int in a list sorted in ascending order.
+func ExampleSearchInts() {
+ a := []int{1, 2, 3, 4, 6, 7, 8}
+
+ x := 2
+ i := sort.SearchInts(a, x)
+ fmt.Printf("found %d at index %d in %v\n", x, i, a)
+
+ x = 5
+ i = sort.SearchInts(a, x)
+ fmt.Printf("%d not found, can be inserted at index %d in %v\n", x, i, a)
+ // Output:
+ // found 2 at index 1 in [1 2 3 4 6 7 8]
+ // 5 not found, can be inserted at index 4 in [1 2 3 4 6 7 8]
+}