GV

GeezerVison

The World Wide Web, restored to 800 pixels of glory.

Home|About|Gaming cabinet|Archives|How it works|Starter sites

On this site

  • Sign in
  • ActionsCI/CD and automation
  • CodespacesCloud development environments
  • All Features
  • Documentation
  • Training
  • Certifications
  • Build with Copilot
  • Customize Copilot
  • Integrations
  • Trending repos
  • GitHub Sponsors
  • Developer articles
  • Enterprises

This view

  • Original page
  • New address

GeezerVison is showing github.com — algorithm_basic_java/src/test/java/sort/BubbleSort.java at master · jbee37142/algorithm_basic_java

Expand file tree

/

BubbleSort.java

Copy path
More file actions
More file actions

Latest commit

 

History

History
History
36 lines (30 loc) · 799 Bytes
/

BubbleSort.java

Copy path

File metadata and controls

36 lines (30 loc) · 799 Bytes
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
package sort;
import org.junit.Test;
import utils.Utils;
import static org.hamcrest.CoreMatchers.is;
import static org.junit.Assert.assertThat;
public class BubbleSort {
/*
TASK
bubble sort를 구현한다.
*/
@Test
public void test() {
int[] arr = {2,1,4,0,3};
int[] sortedArr = new int[arr.length];
for (int i = 0; i < sortedArr.length; i++) {
sortedArr[i] = i;
}
assertThat(sort(arr), is(sortedArr));
}
public int[] sort(int[] arr) {
for (int i = 0; i < arr.length - 1; i++) {
for (int j = i + 1; j < arr.length; j++) {
if (arr[i] > arr[j]) {
Utils.swapValue(arr, i, j);
}
}
}
return arr;
}
}
You are visitor 01402503 — GeezerVison does not store the pages you look up.
Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required.