I am an aspiring front end web developer in university. I am trying to learn to get a solid grasp on concepts.

Below I have written a bubble sort pseudocode algorithm and I gave it to AI to check it, and of course it found several mistakes, however I believe I may or may not learn better the traditional way. This is written in pseudocode as this is taught this way in my university.

function Bsort (vector) 
count = 0 
n = len[vector ] 
while count < n 
 for i =1 to i = n-1 
  if vector[i] >vector [i + 1] 
   swap(vector[i] . i+1 ) 
count++

Is this a good algorithm for implementing a bubble sort?