e = 10 
za = 0
i = 1
while (e > 10**-8) {
  zb = za +((1)/((i-1)+(i-2)))
  e = abs(za-zb)
  za=zb
  i = i+1
}
zb

e = 10 
z0 = 0
i = 1
while (e > 10**-8) {
  z1 = z0 + (50/(i**5))
  e = abs(z1-z0)
  z0=z1
  i = i+1
}
z1

x = c(13,7,6,45,21,9,101,102)

sorting <- function(x){
n <- length(x)



for(i in 1:(n-1)){
  for(j in 1:(n-i)) {
    if(x[j+1] > x[j]) {
      tmp <- x[j]
      x[j] <- x[j+ 1]
      x[j+1] <- tmp
    }
  }
  }
  return(x)
}
sorting(x)