Skip to content

Instantly share code, notes, and snippets.

View ronsc's full-sized avatar

Ronnakorn Jannnalao ronsc

View GitHub Profile
@ronsc
ronsc / Exam3.java
Created November 8, 2013 09:44
โจทย์ OOT Midterm ข้อที่ 3
public class Exam3 {
public static void main(String[] args){
Utility.add(123);
Utility.add(987654321);
System.out.println("=====");
Utility.print("HELLO");
Utility.print("SUT");
}
}
@ronsc
ronsc / Calculator.java
Created November 8, 2013 09:37
โจทย์ OOT Midterm ข้อที่ 2
public class Calculator {
public void sumOddIndex(int[] x){
int sum = 0;
System.out.print("Sum only ");
for(int i = 1; i < x.length; i+=2){
System.out.print(x[i] + " ");
sum += x[i];
}
System.out.println(" = " + sum);
}
@ronsc
ronsc / Collar.java
Created November 8, 2013 09:22
โจทย์ OOT Midterm ข้อที่ 1
public class Collar{
private String colour;
Collar(String colour){
this.colour = colour;
}
public String getColour(){
return colour;
}
@ronsc
ronsc / Carry.java
Created November 8, 2013 04:03
โปรแกรมหาผลบวกของเลขมากๆแล้วมีตัวทด โปรแกรมนี้พิมได้สูงสุด 200 หลัก
import java.util.Scanner;
public class Carry{
public static void main(String[] a){
Scanner sc = new Scanner(System.in);
int[] n1 = new int[200];
int[] n2 = new int[200];
//รับค่าตัวเลขตัวที่ 1
@ronsc
ronsc / Insertsort.c
Created November 3, 2013 07:27
Sorting Algorithm [Insertsort] ><
#include<stdio.h>
void main(){
int i, j, tmp, k;
int x[] = {23, 78, 45, 8, 32, 56};
int n = 6;
for(i = 1; i < n; i++){
tmp = x[i];
for(j = i; j > 0 && tmp < x[j-1]; j--){
x[j] = x[j-1];
@ronsc
ronsc / Selectionsort.c
Last active December 27, 2015 07:19
Sorting Algorithm [Selectionsort] ><
#include<stdio.h>
void main(){
int i, j, min = 1, tmp;
int x[] = {23, 78, 45, 8, 32, 56};
int n = 6;
for(i = 0; i < n; i++){
min = i;
for(j = i+1; j < n; j++){
min = x[j] < x[min] ? j : min;
@ronsc
ronsc / Quicksort.c
Created November 3, 2013 07:24
Sorting Algorithm [Quicksort] ><
#include<stdio.h>
int partition(int [], int, int);
void quicksort(int [], int, int);
int x[] = {5, 6, 1, 2, 3, 4};
int l = 0, r = 5, i, j;
void main(){
quicksort(x, l, r);
for(j = 0; j < r+1; j++)
printf("%-3d", x[j]);
@ronsc
ronsc / No2.java
Created October 30, 2013 11:04
สอบแลป OOT ครั้งที่ 1 กลุ่มที่ 1 >>> ข้อที่ 2 (รันบน Netbeans)
package labtest.no2;
import java.util.Scanner;
public class No2 {
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
System.out.print("Enter gen : ");
char ch = sc.next().charAt(0);
@ronsc
ronsc / No1.java
Created October 30, 2013 11:01
สอบแลป OOT ครั้งที่ 1 กลุ่มที่ 1 >>> ข้อที่ 1 (รันบน Command Line)
import java.util.Scanner;
public class No1 {
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
System.out.print("Enter size: ");
int size = sc.nextInt();
int i = 0, n = 1;
@ronsc
ronsc / Bike.java
Created October 24, 2013 10:41
OOT แลป 5 กลุ่มเรียนที่ 2
package oot.lab5.group2.bike;
public class Bike {
private String brand;
private Wheel frontWheel;
private Wheel rearWheel;
public void setBrand(String brand){
this.brand = brand;
}