From Gossip@caterpillar

Algorithm Gossip: 碻穓碝猭ㄏノ矫

弧

穓碝ヘ琌逼戈い碝т﹚戈τ讽い碻穓碝琌程膀セ穓碝猭璶眖戈秨繷碝т程琌т戈

秆猭

厩碻穓碝计常穦ㄏノよΑㄓ秈︽穓碝
while(i < MAX) {
    if(number[i] == k) {
        printf("т﹚");
        break;
    }
    i++;
}
 

硂よ猭膀セ⊿Τ岿琌э到ノ砞﹚矫よΑif耞Α矫硄盽砞﹚计程┪琌程玡よ安砞砞﹚玡よま0 竚и眖计よ玡т狦т﹚戈ㄤまぃ琌0ボ计ǐ砐Чぇ玡碞т祘Α级糶璶ㄏノwhile癹伴碞 

祘Α皌矫砞竚︽ㄏノе硉逼猭盢玻ネ计逼礛秈︽穓碝璝琌计杠硄盽眤ㄏノ祘Α粂ēㄧΑ畐┮矗ㄑ穓碝ㄧΑ

龟C    Java    Python    Scala    Ruby

  • C 
#include <stdio.h> 
#include <stdlib.h> 
#include <time.h> 
#define MAX 10 
#define SWAP(x,y) {int t; t = x; x = y; y = t;} 

int search(int[]); 
int partition(int[], int, int); 
void quickSort(int[], int, int); 

int main(void) { 
    srand(time(NULL)); 
    
    int number[MAX+1] = {0};    

    int i;
    for(i = 1; i <= MAX; i++) 
        number[i] = rand() % 100; 

    quickSort(number, 1, MAX); 

    printf("计"); 
    for(i = 1; i <= MAX; i++) 
        printf("%d ", number[i]); 
    
    printf("\n块穓碝"); 
    scanf("%d", &number[0]); 

    int find = search(number);
    if(find >= 0) 
        printf("\nт计ま %d ", find); 
    else 
        printf("\nтぃ计"); 

    printf("\n"); 

    return 0; 
} 

int search(int number[]) { 
    int i = MAX; 
    while(number[i] != number[0]) i--; 
    return i; 
} 

int partition(int number[], int left, int right) { 
    int s = number[right]; 
    int i = left - 1; 

    int j;
    for(j = left; j < right; j++) { 
        if(number[j] <= s) { 
            i++; 
            SWAP(number[i], number[j]); 
        } 
    } 

    SWAP(number[i+1], number[right]); 
    return i+1; 
} 

void quickSort(int number[], int left, int right) { 
    if(left < right) { 
        int q = partition(number, left, right); 
        quickSort(number, left, q-1); 
        quickSort(number, q+1, right); 
    } 
}

  • Java 
public class Search {
    public static int linear(int[] number, int des) {
        int[] tmp = new int[number.length + 1];
        for(int i = 1; i < tmp.length; i++) {
            tmp[i] = number[i-1];  
        }
        
        tmp[0] = des;
        
        int i = number.length; 
        while(tmp[i] != tmp[0]) 
            i--; 

        return i - 1;    
    }
    
    public static void main(String[] args) {
        int[] number = {1, 2, 3, 4, 6, 7, 8};
        int find = Search.linear(number, 3);
        System.out.println(find >= 0 ? "т计ま" + find : "тぃ计"); 
    }
}

  • Python
def search(number, des):
    tmp = [0] * (len(number) + 1)
    for i in range(1, len(number)):
        tmp[i] = number[i - 1]
    tmp[0] = des
    i = len(number)
    while tmp[i] != tmp[0]:
        i -= 1
    return i - 1

number = [1, 4, 2, 6, 7, 3, 9, 8]
number.sort()
find = search(number, 2)
print("т计ま " + str(find) if find >= 0 else "тぃ计")

  • Scala
object Search {
    def linear(number: Array[Int], des: Int): Int = {
        val tmp = new Array[Int](number.length + 1)
        for(i <- 1 until tmp.length) {
            tmp(i) = number(i - 1)
        }
        tmp(0) = des
        for(i <- number.length until (0, -1) if tmp(i) == des) {
            return i -1
        }
        return -1
    }
}

val number = Array(1, 2, 3, 4, 6, 7, 8)
val find = Search.linear(number, 3)
println(if(find >= 0) "т计ま " + find else "тぃ计")

  • Ruby
# encoding: Big5
def search(number, des)
    tmp = Array.new(number.length + 1, 0)
    1.upto(number.length  - 1) { |i|
        tmp[i] = number[i - 1]
    }
    tmp[0] = des
    i = number.length
    while tmp[i] != tmp[0]
        i -= 1
    end
    i - 1
end

number = [1, 4, 2, 6, 7, 3, 9, 8]
number.sort!
find = search(number, 2)
print find >= 0 ? "т计ま " + find.to_s : "тぃ计", "\n"