Vorlesung 8 Belkouchi

Aus ProgrammingWiki

Seite 11

var alphabet = ['a', 'b', 'c'];
function isPrime(num) {

  if (num === 2) {
    return true;
  } else if (num > 1) {
    for (var i = 2; i < num; i++) {

      if (num % i !== 0) {
        return true;
      } else if (num === i * i) {
        return false
      } else {
        return false;
      }
    }
  } else {
    return false;
  }

}
function nextPrime(num){
num++;
while(true){
  if(isPrime(num))
    return num;
  num++;
}
}
function G(word){
    var g = 1;
    var p = 1;
	var word=word;
	for (var j = 0; j < word.length; j++) {
        if(!alphabet.includes(word.charAt(j)))
            return "word not in alphabet";
    
      var i = 0;
        while (i < alphabet.length){
            if (word.charAt(j) == alphabet[i]){
                i ++;
                break;
			}
            i ++;
     }
        p = nextPrime(p);
        g *= p ** i;
   
	};
	 return g;
}

G("abc");

Vorlesung 8 Belkouchi

Seite 11

Suche