Created
December 10, 2019 09:11
-
-
Save mzuvin/79b3489874ce4ed136f6032d355e148f to your computer and use it in GitHub Desktop.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
str="mustafa" | |
str2=[] | |
// 0.adım string dizisini sayısal değerlere çevir. | |
for (var i=0; i<str.length;i++){ | |
str2.push(str[i].charCodeAt(0)) | |
} | |
//1. adım: dizideki i. sırasından sonraki en küçük sayının yerini bul. | |
function selectionSort(num) { | |
var len = num.length; | |
for(var i = 0; i < len; i++) { | |
var min = i; | |
for(var j = i + 1; j < len; j++) { | |
if(num[j] < num[min]) | |
min = j; | |
} | |
if(min != i) { | |
var temp = num[i]; | |
num[i] = num[min]; | |
num[min] = temp; | |
} | |
} | |
return num | |
} | |
//2.adım sayısal değerleri karaktere çevir. | |
function asciitoStr(arr,join){ | |
var string=""; | |
for (var i=0; i<arr.length; i++){ | |
if (join) | |
string=string+String.fromCharCode(arr[i]); | |
else | |
arr[i]=String.fromCharCode(arr[i]); | |
} | |
if(join) | |
console.log(string) | |
else | |
console.log(arr) | |
} | |
var arr=selectionSort(str2); | |
console.log(arr) | |
asciitoStr(arr,true) | |
asciitoStr(arr) | |
/* | |
(7) [97, 97, 102, 109, 115, 116, 117] | |
aafmstu | |
(7) ["a", "a", "f", "m", "s", "t", "u"] | |
*/ | |
/*2.Yöntem */ | |
console.log(selectionSort("mustafa".split(""))) | |
/*3.Yöntem kısa */ | |
var a="coderbyte"; | |
console.log(a.split("").sort().join("")) | |
/* | |
bcdeeorty | |
split => str to arr | |
sort() | |
join => arr to str | |
*/ | |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment