This repository was archived by the owner on Oct 27, 2024. It is now read-only.

Commit 763a752

authored

Merge branch 'd-coder111:main' into main

2 parents a6740b3 + 6419add commit 763a752Copy full SHA for 763a752

File tree

+31

-2

lines changed

+31

-2

lines changed

Lines changed: 29 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,29 @@`
	`1`	`+#include <bits/stdc++.h>`
	`2`	`+using namespace std;`
	`3`	`+`
	`4`	`+int findPeakElement(int arr[], int n)`
	`5`	`+{`
	`6`	`+ int start = 0;`
	`7`	`+ int end = n - 1;`
	`8`	`+ while (start < end)`
	`9`	`+ {`
	`10`	`+ int mid = start + (end - start) / 2;`
	`11`	`+ if (arr[mid] > arr[mid + 1])`
	`12`	`+ {`
	`13`	`+ end = mid;`
	`14`	`+ }`
	`15`	`+ else`
	`16`	`+ {`
	`17`	`+ start = mid + 1;`
	`18`	`+ }`
	`19`	`+ }`
	`20`	`+ return start;`
	`21`	`+}`
	`22`	`+`
	`23`	`+int main()`
	`24`	`+{`
	`25`	`+ int arr[] = {1000, 11, 445, 1, 330, 3000};`
	`26`	`+ int n = sizeof(arr) / sizeof(arr[0]);`
	`27`	`+ int ans = findPeakElement(arr, n);`
	`28`	`+ cout << "Index of the peak element of array [ 1000, 11, 445, 1, 330, 3000 ] is " << ans;`
	`29`	`+}`

Lines changed: 2 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,6 +1,6 @@`
`1`	`1`	`//Link:-https://leetcode.com/problems/find-peak-element/`
`2`	`2`
`3`		`-class Main {`
	`3`	`+class FindPeakElement {`
`4`	`4`	`public static int findPeakElement(int[] arr) {`
`5`	`5`	`int start = 0;`
`6`	`6`	`int end = arr.length - 1;`
`@@ -18,6 +18,6 @@ public static int findPeakElement(int[] arr) {`
`18`	`18`	`public static void main(String[] args) {`
`19`	`19`	`int arr[] = { 1000, 11, 445, 1, 330, 3000 };`
`20`	`20`	`int ans = findPeakElement(arr);`
`21`		`- System.out.println("Peak element is " + ans);`
	`21`	`+ System.out.println("Index of the peak element of array [ 1000, 11, 445, 1, 330, 3000 ] is " + ans);`
`22`	`22`	`}`
`23`	`23`	`}`

Comments

(0)