Commit 0939859

committed

commit

1 parent 5d13604 commit 0939859Copy full SHA for 0939859

File tree

3 files changed

+35

-36

lines changed

FastClosestPoint2D
- .idea
  - workspace.xml
- out/production/FastClosestPoint2D/com/xplore/solutions
  - ClosestPoint2D.class
- src/com/xplore/solutions
  - ClosestPoint2D.java

3 files changed

+35

-36

lines changed

`‎FastClosestPoint2D/.idea/workspace.xml`

Lines changed: 28 additions & 28 deletions

Some generated files are not rendered by default. Learn more about customizing how changed files appear on GitHub.

`‎FastClosestPoint2D/out/production/FastClosestPoint2D/com/xplore/solutions/ClosestPoint2D.class`

22 Bytes

Binary file not shown.

`‎FastClosestPoint2D/src/com/xplore/solutions/ClosestPoint2D.java`

Lines changed: 7 additions & 8 deletions

Original file line number	Diff line number	Diff line change
`@@ -62,12 +62,12 @@ public static double brute(Point2d[] array, int lo, int hi) {`
`62`	`62`	`/**`
`63`	`63`	`* n log(n)`
`64`	`64`	`* */`
`65`		`- private static double solver(Point2d[] orderByX, Point2d[] aux, int hi) {`
	`65`	`+ private static double solver(Point2d[] orderByX, Point2d[] aux, int lo, inthi) {`
`66`	`66`	`if(hi <= 3)`
`67`		`- return brute(orderByX, 0, hi);`
	`67`	`+ return brute(orderByX, lo, hi);`
`68`	`68`	`int mid = hi/2;`
`69`		`- double left = solver(orderByX, aux, mid);`
`70`		`- double right = solver(orderByX, aux, hi - mid);`
	`69`	`+ double left = solver(orderByX, aux, 0, mid);`
	`70`	`+ double right = solver(orderByX, aux, mid+1, hi - mid);`
`71`	`71`	`double currentMin = Math.min(left, right);`
`72`	`72`	`int k = 0;`
`73`	`73`	`for (int i = 0; i < hi ; i++) {`
`@@ -187,20 +187,19 @@ else if(k == 2) {`
`187`	`187`	`,new Point2d(1, -1)`
`188`	`188`	`}`
`189`	`189`	`,{`
`190`		`- new Point2d(0, 3)`
	`190`	`+ new Point2d(0, 3)`
`191`	`191`	`,new Point2d(3, 4)`
`192`	`192`	`,new Point2d(4, 2)`
`193`	`193`	`,new Point2d(-2, 1)`
`194`	`194`	`,new Point2d(1, -1)`
`195`	`195`	`}`
`196`	`196`	`,{`
`197`		`- new Point2d(0, 2)`
	`197`	`+ new Point2d(0, 2)`
`198`	`198`	`,new Point2d(6, 67)`
`199`	`199`	`,new Point2d(43, 71)`
`200`	`200`	`,new Point2d(39, 107)`
`201`	`201`	`,new Point2d(189, 140)`
`202`	`202`	`}`
`203`		`-`
`204`	`203`	`};`
`205`	`204`
`206`	`205`	`public static void test() {`
`@@ -209,7 +208,7 @@ public static void test() {`
`209`	`208`	`System.arraycopy(matrix[idx], 0, points, 0, points.length);`
`210`	`209`	`Arrays.sort(points, SORT_BY_X);`
`211`	`210`
`212`		`- double min = solver(points, new Point2d[points.length], points.length);`
	`211`	`+ double min = solver(points, new Point2d[points.length], 0, points.length);`
`213`	`212`	`System.out.println(min);`
`214`	`213`
`215`	`214`	`Point2d [] pQ = solver2(points, new Point2d[points.length], points.length);`

0 commit comments

Comments

(0)

Navigation Menu

Search code, repositories, users, issues, pull requests...

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!

Commit 0939859

File tree

3 files changed

3 files changed

`‎FastClosestPoint2D/.idea/workspace.xml`

`‎FastClosestPoint2D/out/production/FastClosestPoint2D/com/xplore/solutions/ClosestPoint2D.class`

`‎FastClosestPoint2D/src/com/xplore/solutions/ClosestPoint2D.java`

0 commit comments