Skip to content
View Bablzz's full-sized avatar
💭
Quality is remembered long after the price is forgotten (Sir Frederick Royce)
💭
Quality is remembered long after the price is forgotten (Sir Frederick Royce)

Block or report Bablzz

Block user

Prevent this user from interacting with your repositories and sending you notifications. Learn more about blocking users.

You must be logged in to block users.

Please don't include any personal information such as legal names or email addresses. Maximum 100 characters, markdown supported. This note will be visible to only you.
Report abuse

Contact GitHub support about this user’s behavior. Learn more about reporting abuse.

Report abuse
Bablzz/README.md

Hello everyone!👋

I've been working as a software engineer since 2012. Currently I am living in Saint-Petersburg, Russia. I am enjoing DevOps process, problems solving. I have experience in public speaking; have ISTQB FL certificate.

Tools: Go, Bash, Yaml😄

💬 Ask me about testing proccess, CI/CD (ansible, gitlab, teamcity, github action)

📫 My Linkedin. Feel free to connect with me.

Pinned Loading

  1. algowithgo algowithgo Public

    Algorithms with Go

    Go

  2. testcontainers-go testcontainers-go Public

    Forked from testcontainers/testcontainers-go

    Testcontainers is a Golang library that providing a friendly API to run Docker container. It is designed to create runtime environment to use during your automatic tests.

    Go

  3. Convert string UTF-8 to UTF-16LE golang Convert string UTF-8 to UTF-16LE golang
    1
    const BOM = '\ufffe' //LE. for BE '\ufeff'
    2
    
                  
    3
    func createFile(name string) error {
    4
    	var bytes [2]byte
    5
    	data := `test string UTF-8`
  4. quicksort in ruby quicksort in ruby
    1
    =begin
    2
    Worst time: O(n2) if choose bad pivot element
    3
    Approximate time: O(n log n)
    4
    =end
    5
    
                  
  5. Merge sort Merge sort
    1
    /*
    2
    best time O(n log2 n)
    3
    worst time O(n log2 n)
    4
    */
    5
    
                  
  6. binary search binary search
    1
    # Best O(1)
    2
    # Worst O(long n)
    3
    
                  
    4
    arr = [1,2,3,4,5,6,7,10]
    5