'Return table' diaporamas de présentation

Algoritma dan Struktur Data

Algoritma dan Struktur Data. Linear & Binary Search Tree. Linear Search. struct { int key; int data; } table[100]; int n; int search(int key) { int i; i=0; while (i < n){ if(table[i].key==key) return(table[i].data); i++; } return -1; }. statement. (1). (2).

589 views • 44 slides