DEV Community: André Maré

The 8 Types of Waste in Lean Methodology

André Maré — Wed, 24 Jul 2024 19:05:50 +0000

The Underlying Causes of Waste in Software Engineering

Photo by Gary Chan on Unsplash

Staying competitive and delivering high-quality software on time requires exceptional efficiency in today’s fast-paced software engineering world. However, many organisations encounter various forms of waste that diminish productivity and escalate costs.

The Lean methodology, with its systematic approach, offers valuable insights into identifying and eliminating these inefficiencies. By following Lean principles, software engineering teams can confidently tackle waste and improve their processes.

In this blog, we will explore the eight types of waste defined by Lean principles and examine their root causes within software engineering.

Understanding these sources of waste will enable teams to implement strategies to streamline their workflows, optimise their resources, and ultimately deliver better software more efficiently.

What are the Types of Work?

According to Lean methodology, work activities can be categorised into three main types:

Value-Added Work : Activities that directly contribute to creating value for the customer. These activities transform the product or service in a way the customer is willing to pay for.
Non-Value-Added (Essential) Work: Activities that don’t directly add value from the customer’s perspective but are currently required for business operations, regulatory compliance, or other essential reasons.
Non-Value-Added (Non-Essential) Work: Activities that consume resources without adding value to the product or service from the customer’s perspective. These are considered pure waste and should be eliminated.

The definition of waste (or “muda” in Japanese) in Lean methodology is any activity or process that does not add value from the customer’s perspective.

This concept extends beyond just physical waste to include inefficiencies in processes, unnecessary steps, and underutilised resources.

The purpose is to identify and eliminate waste, ensuring that products flow efficiently through the business.

What are the different types of Waste?

Lean practitioners identify eight types of waste: defects, overproduction, waiting, non-utilised skills, transportation, inventory, motion, and excess processing.

By systematically identifying and eliminating these forms of waste, organisations can streamline their operations, improve efficiency, and ultimately deliver greater value to their customers.

Defects : Flaws requiring rework and leading to customer dissatisfaction.

Defects are flaws or errors in products or services that fail to meet quality standards or customer expectations. They result in rework, increased costs, and customer dissatisfaction.

Overproduction : Producing more than necessary, causing excess inventory.

Overproduction occurs when more products or services are produced than are needed or before they are required. This leads to excess inventory, increased storage costs, and potential waste of resources.

Waiting : Idle time causing delays and reduced efficiency.

Waiting refers to idle time when no value-adding activities occur, often due to delays, bottlenecks, or inefficient processes. This waste can slow down overall production and reduce efficiency.

Non-Utilised Talent : Underutilising employee skills and creativity.

Non-utilised talent is the failure to fully leverage the skills, knowledge, and creativity of employees. This results in missed opportunities for improvement, innovation, and overall organisational growth.

Transportation : Unnecessary movement of materials and information.

Transportation waste involves unnecessary movement of materials, products, or information that does not add value to the process. Excessive transportation can lead to increased costs and longer lead times.

Inventory : Excess stock tying up capital and space.

Inventory waste refers to excess stock of raw materials, work-in-progress, or finished goods that do not contribute to value creation. High levels of inventory can tie up capital and increase storage costs.

Motion : Unnecessary movements reducing efficiency.

Motion waste involves unnecessary physical movements by workers that do not contribute to value creation. This can result from poor workplace layout or ergonomics, leading to inefficiencies.

Extra Processing : Unnecessary work beyond customer requirements.

Extra processing occurs when work is performed beyond what the customer requires or is willing to pay for. This often results from unclear specifications, leading to wasted resources and time.

Lean Methodology: 8 Types of Waste

Waste in Software Engineering

The concept of waste in lean manufacturing can be effectively translated to software engineering, as both domains aim to optimise processes and eliminate inefficiencies. The eight wastes of manufacturing have direct parallels in software engineering:

Defects → Defects (Software Engineering)
Overproduction → Extra Features (Software Engineering)
Waiting → Waiting (Software Engineering)
Non-utilised Talent → Non-utilised Talent (Software Engineering)
Transportation → Task Switching (Software Engineering)
Inventory → Partially Done Work (Software Engineering)
Motion → Motion (Software Engineering)
Extra Processing → Extra Processes (Software Engineering)

Continue Reading

Continue reading the rest of the article on my Medium Blog.

The 8 Types of Waste in Lean Methodology

Follow me (👥 André Maré) or my personal blog (Beyond Engineering) for more posts like this.

Install Apache Kafka on macOS using Homebrew

André Maré — Sun, 01 Jan 2023 00:00:00 +0000

What is Kafka?
Brew Installation Commands
Directory Structure
Brew Run Commands
Alternative Commands
Testing Installation
Summary

Apache Kafka is a popular open-source stream-processing software platform developed by the Apache Software Foundation. Installing and configuring Kafka can sometimes be daunting, but the process is significantly simplified thanks to Homebrew (or brew), a package manager for macOS.

This blog will guide you through installing Kafka on macOS using Homebrew.

What is Kafka?

“Apache Kafka acts as a decoupling layer between source and target systems, allowing source systems to produce data into Kafka, and target systems to consume data from Kafka, making the architecture more scalable and manageable.” Apache Kafka

Brew Installation Commands

Before installing Kafka using Homebrew, you must ensure that Homebrew is installed on your Mac. Once Homebrew is installed, you can use the brew install command to install both Kafka and Zookeeper, as Kafka has a dependency on Zookeeper which will be resolved by Homebrew automatically.

Command: Install Homebrew

$ /bin/bash -c "$(curl -fsSL https://raw.githubusercontent.com/Homebrew/install/HEAD/install.sh)"

Command: Install Kafka

$ brew install kafka

This command will install both Kafka and Zookeeper, as Zookeeper is a dependency for Kafka.

Directory Structure

After the installation is complete, the Kafka and Zookeeper binaries, configurations, and logs will be located in different directories based on your Mac’s chip.

Macs with Intel Processor:

Binaries and scripts will be in /usr/local/bin
Kafka configurations will be in /usr/local/etc/kafka
Zookeeper configuration will be in /usr/local/etc/zookeeper
The log.dirs config (Kafka data) will be set to /usr/local/var/lib/kafka-logs

Macs with Apple Silicon Processor:

Binaries and scripts will be in opt/homebrew/bin
Kafka configurations will be in opt/homebrew/etc/kafka
Zookeeper configuration will be in opt/homebrew/etc/zookeeper
The log.dirs config (Kafka data) will be set to opt/homebrew/var/lib/kafka-logs

You can modify the Kafka and Zookeeper configuration files to customize your setup.

Brew Run Commands

Once you have installed Kafka and Zookeeper, you can start them using the brew services command. This command will start Kafka and Zookeeper as background services, so they will continue running even if you close your terminal.

Command: Start Zookeeper and Kafka

$ brew services start zookeeper
$ brew services start kafka

Command: Stop Zookeeper and Kafka

$ brew services stop kafka
$ brew services stop zookeeper

Command: Restart Zookeeper and Kafka

$ brew services restart kafka
$ brew services restart zookeeper

Alternative Commands

While Homebrew provides a convenient way to manage services, you can also start Zookeeper and Kafka manually using the provided scripts. This involves running the zookeeper-server-start.sh and kafka-server-start.sh scripts with the appropriate configuration files.

Command: Start Zookeeper

$ /usr/local/bin/zookeeper-server-start /usr/local/etc/zookeeper/zoo.cfg

Command: Start Kafka

$ /usr/local/bin/kafka-server-start /usr/local/etc/kafka/server.properties

Closing the terminal window or using the Ctrl-C command will stop the Kafka and Zookeeper services. It is important to stop the services properly to avoid any data corruption or loss.

Testing Installation

Testing the Kafka installation involves starting the environment, creating a topic, producing events, and consuming events. After successfully performing these tasks, it is important to clean up the environment by deleting the created topic and stopping the Kafka and Zookeeper services to ensure that the system is left in a clean state.

Command: Start Zookeeper and Kafka

$ brew services start zookeeper
$ brew services start kafka

Creating a topic in Kafka can be done using the kafka-topics -- create command. After creating the topic, it is important to validate its creation by describing the topic using the command kafka-topics --describe, which will display the details of the created topic.

Command: Create a Topic

$ kafka-topics --create --topic quickstart-events --bootstrap-server localhost:9092
$ kafka-topics --describe --topic quickstart-events --bootstrap-server localhost:9092

Producing new events in Kafka can be done using the kafka-console-producer command. This will send a Hello World event to the Kafka topic you created.

Command: Produce Events

$ kafka-console-producer.sh --topic quickstart-events --bootstrap-server localhost:9092
> Hello World 1.
> Hello World 2.

You can stop the producer client with Ctrl-C at any time.

Consuming the events in Kafka can be done using the kafka-console-consumer command. This will retrieve the Hello World event from the Kafka topic you created.

Command: Consume Events

$ kafka-console-consumer --topic quickstart-events --from-beginning --bootstrap-server localhost:9092
> Hello World 1.
> Hello World 2.

You can stop the consumer client with Ctrl-C at any time.

Cleaning up the environment after testing the Kafka installation involves several steps. First, you need to delete the topic you created using the kafka-topics command, then you need to shut down Kafka and Zookeeper using the brew services stop commands, and finally, you need to delete any data of your local Kafka environment, including any events you have created along the way, by removing the Kafka logs and Zookeeper data directories that were specified in the configuration files.

Command: Environment Cleanup

$ kafka-topics --delete --topic quickstart-events --bootstrap-server localhost:9092
$ brew services stop kafka
$ brew services stop zookeeper
$ rm -rf /tmp/kafka-logs /tmp/zookeeper /tmp/kraft-combined-logs

Summary

Installing Kafka on macOS is straightforward using Homebrew. With just a few commands, you can have Kafka and Zookeeper up and running on your machine.

Happy streaming!

Essential cURL Commands for Developers

André Maré — Sat, 27 Jul 2019 22:00:00 +0000

This post provides a quick reference to the cURL commands that I use as a Java developer. This is not a complete set of cURL commands with detailed explanations on what each command does. If you want to read detailed documentation on the different options and arguments of the cURL command, please refer to the man pages of the cURL command.

Furthermore, there are a number of REST Clients and IDEs like Eclipse and IntelliJ that allows you to invoke HTTP requests to a server, however more than often I find myself having to make these calls from the command line as part of a debug process. It is also faster to open a terminal and use these commands to invoke commands than to setup the configuration for different types of requests in your IDE or other UI applications.

Use this reference to learn the cURL command and add it as a critical tool as part of your skillset.

Help and Information Commands

To find help or learn more about the different options and arguements used as part of the curl command, you can type any of the following in the terminal.

# Display quick help information about the curl command
$ curl --help

# Quick search for specific curl options or arguments
$ curl --help | grep {search_value}

# Display the manual page for the curl command
$ man curl

# Displays information about curl and the libcurl version it uses.
$ curl --version
$ curl -V

General

This section contains the basic curl commands on which you can add more options and arguments listed in the other sections.

# Retrieve content of URL and display it on screen
$ curl {URL}

# Write output to a file instead of stdout.
$ curl {URL} > {filename}
$ curl -o {filename} {URL}

# Write output to a local file named like the remote file we get
$ curl -O {URL}

# Enables verbose detail to be displayed
$ curl -v {URL}

# Enables a full trace dump on all incoming and outgoing data.
$ curl --trace {filename} {URL}

# Silent Mode: Don’t show progress meter or error messages.
$ curl -s {URL}

HTTP Headers

HTTP headers are the name or value pairs that are displayed in the request and response messages of message headers for Hypertext Transfer Protocol (HTTP). These commands will help you set and read the HTTP Headers.

# Fetch the headers from the server (HEAD)
$ curl -I {URL}

# Include the HTTP-header in the output
$ curl -i {URL}

# Pass multiple headers as part of the request to the server.
$ curl -H "{HTTP General Header}" -H "{HTTP Request Header}" {URL}

# Include custom HTTP Header in the request to the server.
$ curl -H "{X-Key}:{Value}" {URL}

# Write the received protocol headers to the specified file.
$ curl -D {filename} {URL}

HTTP Cookies

An HTTP cookie is a small piece of data sent from a website and stored on the user’s computer by the user’s web browser while the user is browsing. These commands will help you set and read the HTTP Cookies.

# Write all cookies to filename after completed command.
$ curl -c {filename} {URL}

# Read cookies from file and pass data to HTTP Server in Cookie header. 
$ curl -b {filename} {URL}

# Read cookies from data (key:value) and pass to HTTP Server in Cookie header.
$ curl -b "{key1:value1;key2:value2}" {URL}

# Discard all "session cookies". New session started.
$ curl -j {URL}

Proxy

A proxy server is a server that acts as an intermediary for requests from clients seeking resources from other servers. These commands will help set the proxy server URL and port number and also with authentication.

# Use the specified proxy server and port number
$ curl -x {proxy_url}:{port} {URL}

# Specify the user name and password to use for proxy authentication.
$ curl -U {username}:{password} - x {proxy_url}:{port} {URL}

# Comma-separated list of hosts which do not use a proxy
$ curl --noproxy {url1} -x {proxy_url}:{port} {URL}

FTP Server

The File Transfer Protocol (FTP) is a standard network protocol used for the transfer of computer files between a client and server on a computer network. These commands will help to transfer files to and from a FTP Server.

# Display a directory listing of an FTP site (Anonymous)
$ curl {FTP_URL}

# Retrieve a file from a FTP site. (Anonymous)
$ curl {FTP_URL}/{filename} 

# Upload a file to a FTP site. (Anonymous)
$ curl -T {filename} {FTP_URL}

# Upload Files to an FTP Server. (Secured)
$ curl -u {ftpuser}:{ftppass} -T {filename} {FTP_URL}

# Upload multiple files to an FTP Server
$ curl -u {ftpuser}:{ftppass} -T "{file1,file2}" {FTP_URL}

# Upload a file to a FTP site and append to an existing file
$ curl -T {filename} -a {FTP_URL}/{filename}

HTTP Post/Put Data

The HTTP POST and PUT request method requests that a web server accepts the data enclosed in the body of the request message, most likely for storing it. These commands will show you how to enclose data as part of a request.

# Send data in a POST/PUT request to the HTTP server
$ curl -d '{key1=value1&key2=value2}' -X {POST/PUT} {URL}

# Send data from a file in a POST/PUT request to the HTTP server
$ curl -d {@filename} -X {Post/PUT} {URL}

REST API

A RESTful API is an application program interface (API) that uses HTTP requests to GET, PUT, POST and DELETE data. The following commands illustrate how to invoke REST APIs with different HTTP methods.

# Invoke REST API (GET & JSON)
$ curl -i -H "Content-Type: application/json" -X GET {REST_API}

# Invoke REST API (POST & JSON)
$ curl -i -H "Content-Type: application/json" -X POST -d '{key:value}' {REST_API}

# Invoke REST API (PUT & JSON)
$ curl -i -H "Content-Type: application/json" -X PUT -d '{key:value}' {REST_API}

# Invoke REST API (POST)
$ curl -X DELETE {REST_API}/{ID}

Security

There are numerous ways to authenticate your curl commands against the server. Here are some of the ways to perform authentication.

# Authenticate with username and password
$ curl -u {username}:{password} {URL}

# Authenticate with SSL certificate and password
$ curl --cert {cert_file.pem}:{password} {URL}

Configuration File

The curl configuration file is named .curlrc (Linux) or _curlrc (Windows) and can be found in the user’s home directory.

An example of the file and the entries is as follows:

# The default Proxy and port to use
proxy = 127.0.0.1:8080
# The proxy username and password
proxy-user = "user:pass"
# The timeout is set to 60 seconds
-m 60

Summary

The curl commands listed in this article is by no means a complete set of curl commands and only serve as a quick reference to be used by developers. To see the full documentation of the curl command, please read the man pages of the curl command.

Follow me on any of the different social media platforms and feel free to leave comments.

Alexa Commands

André Maré — Tue, 11 Dec 2018 06:19:20 +0000

What is Alexa?

Amazon Alexa is a virtual assistant developed by Amazon. Alexa was first used in the Amazon Echo and the Amazon Echo Dot smart speakers. Alexa can perform numerous tasks such as voice interaction, making to-do lists, music playback, setting alarms, playing audiobooks and streaming podcasts. She can also provide weather, traffic, sports, and other real-time information, such as news. Other capabilities of Alexa are the control of several smart devices using itself as a home automation system.

Alexa Commands

Alexa has a large number of built-in commands which you can invoke without installing new skills. The following is a list of the commands sorted by categories:

Basic Controls
Alarm & Timer
Bluetooth
Calendar
Funny
General Knowledge
Holidays
Language & Dictionary
Math & Conversion
Movie & TV Series
Music & Books
Quotes
Random
Sport
Star Wars
Weather

Basic Control Commands

“Alexa, help.”
“Alexa, open {skill name}.”
“Alexa, enable {skill name}.”
“Alexa, disable {skill name}.”
“Alexa, stop.”
“Alexa, cancel.”
“Alexa, louder.”
“Alexa, softer.”
“Alexa, turn up the volume.”
“Alexa, turn down the volume.”
“Alexa, mute.”
“Alexa, unmute.”
“Alexa, volume {1-10}.”
“Alexa, go to sleep.”

Alarm & Timer Commands

“Alexa, set an alarm for {time}”
“Alexa, set a repeating alarm for {time} weekdays”
“Alexa, when’s my next alarm?”
“Alexa, turn off”
“Alexa, snooze”
“Alexa, snooze for {x minutes}”
“Alexa, cancel my alarm for {time}”
“Alexa, cancel all alarms”
“Alexa, wake me up at {time}.”
“Alexa, wake me up everyday at {time}”
“Alexa, wake me up at {time} to {music}.”
“Alexa, wake me up to {song} by {artist} at {time}.”
“Alexa, wake me up to {news service} at {time}.”
“Alexa, timer.”
“Alexa, set timer for {x minutes}.”
“Alexa, set a 10 minute {named} timer.”
“Alexa, how long is left on the timer?”
“Alexa, how long is left on the {named} timer?”
“Alexa, what are my timers?”
“Alexa, stop the timer”
“Alexa, cancel the {named} timer”
“Alexa, what is the time?”
“Alexa, what is the date?”

Bluetooth Commands

“Alexa, bluetooth.”
“Alexa, pair.”
“Alexa, connect to my phone.”
“Alexa, connect to my speaker.”
“Alexa, disconnect from my phone.”
“Alexa, disconnect from my speaker.”
“Alexa, discover my devices.”

Calendar Commands

“Alexa, what’s on my calendar?”
“Alexa, what’s on my calendar [tomorrow]?”
“Alexa, what’s on my schedule?”
“Alexa, what is my next event?”
“Alexa, what is my next appointment?”
“Alexa, create new event.”
“Alexa, add [name] to my calendar for [day] at [time].”
“Alexa, add [event_name] with [person’s name].”
“Alexa, invite [person’s name] to [event_name].”
“Alexa, delete my [event_name] event.”
“Alexa, cancel my [date] event.”
“Alexa, move my [event_name] to [time/date].”
“Alexa, what is the time?”
“Alexa, what is the date?”
“Alexa, how many days until [date]?”
“Alexa, how many days until Christmas?”
“Alexa, how many days until [holiday_name]?”
“Alexa, what time is it in Paris?”
“Alexa, Alexa, when is the next lunar eclipse?”

Funny Commands

“Alexa, do you have a boyfriend?”
“Alexa, ha ha!”
“Alexa, who’s better, you or Siri?”
“Alexa, what do you think about Google Now?”
“Alexa, what do you think about Cortana?”
“Alexa, what do you think about Siri?”
“Alexa, why is six afraid of seven?”
“Alexa, all your base are belong to us.”
“Alexa, you talkin’ to me!”
“Alexa, roses are red.”
“Alexa, where is Chuck Norris?”
“Alexa, open Jurassic Bark.”
“Alexa, who let the dogs out?”
“Alexa, knock, knock.”
“Alexa, tell me a football joke.”
“Alexa, tell me a vegetable joke.”
“Alexa, tell me a Thanksgiving joke.”
“Alexa, tell me a joke about you.”

General Knowledge Commands

“Alexa, what does the Earth weigh?”
“Alexa, who wrote the Harry Potter series?”
“Alexa, what is the currency of South Africa?”
“Alexa, do dogs dream?”
“Alexa, how hot is the sun?”
“Alexa, what is Roblox?”
“Alexa, random fact.”
“Alexa, Romeo, Romeo, wherefore art thou Romeo?”
“Alexa, who is Nelson Mandela?”
“Alexa, who is Barack Obama?”
“Alexa, who is Juius Ceaser?”
“Alexa, give a fact about Africa.”
“Alexa, who was the first man on the moon?”
“Alexa, who was the first man on mount Everest?”
“Alexa, when was McDonald’s founded?”
“Alexa, give me a dinosaur fact.”

Holiday Commands

“Alexa, merry Christmas”
“Alexa, is there a Santa?”
“Alexa, tell me a Christmas joke.”
“Alexa, sing me a Christmas song.”
“Alexa, how many days until Christmas?”
“Alexa, sing me a Christmas carol.”
“Alexa, how old is Santa Claus?”
“Alexa, where does Santa Claus live?”
“Alexa, is Santa Claus real?”
“Alexa, tell me about Santa’a reindeer.”
“Alexa, who is you favourite reindeer?”
“Alexa, read “The night Before Christmas.”
“Alexa, when is Thanksgiving?”
“Alexa, tell me a Thanksgiving haiku.”
“Alexa, what is the history of Thanksgiving?”
“Alexa, what are you thankful for?”
“Alexa, happy birthday!”
“Alexa, happy New Year!”
“Alexa, happy holidays!”
“Alexa, happy Valentine’s Day!”
“Alexa, sing happy birthday.”
“Alexa, happy Mother’s Day.”
“Alexa, happy Father’s Day.”
“Alexa, happy Easter.”

Language & Dictionary Commands

“Alexa, how do you spell birthday?”
“Alexa, say hello in French.”
“Alexa, what is the word of the day?”
“Alexa, give me a spelling bee word.”
“Alexa, what is the definition of beautiful.”
“Alexa, how do you spell beautiful.”
“Alexa, what is the antonym of beautiful.”
“Alexa, what is the synonym of beautiful.”
“Alexa, what rhyme with beautiful.”

Math & Conversion Commands

“Alexa, what is 5 plus 5?”
“Alexa, what is 5 minus 5?”
“Alexa, what is 5 times 5?”
“Alexa, what is 5 divided by 5?”
“Alexa, what is 5 squared?”
“Alexa, what is the square root of 25?”
“Alexa, what is 5 cubed?”
“Alexa, what is 5 to the number of 5?”
“Alexa, what is 5 factorial?”
“Alexa, what is 5% of 5?”
“Alexa, is 5 a prime number?”
“Alexa, what is fibonacci numbers?”
“Alexa, divide by zero?”

Movie & TV Series Commands

“Alexa, what is your favourite movie?”
“Alexa, what movies are playing?”
“Alexa, who plays in Die Hard?”
“Alexa, what is the IMDb rating for Die Hard?”
“Alexa, what was Bruce Willis first movie?”
“Alexa, what is Bruce Willis latest movie?”
“Alexa, how many Oscars has Bruce Willis won?”
“Alexa, what is the top grossing movie this week?”
“Alexa, give a quote from Die Hard.”
“Alexa, are we in the Matrix?”
“Alexa, what is the first rule of fight club?”
“Alexa, what is the second rule of fight club?”
“Alexa, what is your favorite holiday movie?”
“Alexa, what is the Die Hard movie about?”
“Alexa, what is your favourite TV Series?”
“Alexa, who plays in Game of Thrones?”
“Alexa, who plays Jon Snow in Game of Thrones?”
“Alexa, what time is the Emmy Awards?”
“Alexa, who lives in a pineapple under the sea?”
“Alexa, who is the mother of dragons?”
“Alexa, is Jon Snow dead?”
“Alexa, when is the Macy’s Thanksgiving Day Parade on TV?”
“Alexa, what’s the most popular TV show?”

Music & Books Commands

“Alexa, shuffle mode on.”
“Alexa, shuffle mode off.”
“Alexa, loop.”
“Alexa, play.”
“Alexa, pause.”
“Alexa, next.”
“Alexa, previous.”
“Alexa, restart.”
“Alexa, play some music.”
“Alexa, play Beyoncé.”
“Alexa, play music by Beyoncé.”
“Alexa, play music by Frank sinatra.”
“Alexa, what’s playing?”
“Alexa, play my Rock Ballades playlist.”
“Alexa, wake me up to Beyoncé.”
“Alexa, play Katy Perry’s new holiday song from Amazon Music.”
“Alexa, give me a famous first line.”
“Alexa, read me a mystery.”
“Alexa, read a sample of Becoming by Michelle Obama from Audible.”
“Alexa, tell me a Ripley’s Believe It or Not story.”

Quote Commands

“Alexa, give me a Stephen Hawking quote.”
“Alexa, give me a Nelson Mandela quote.”
“Alexa, give me a Barack Obama quote.”
“Alexa, give me a William Shakespeare quote.”

Random Commands

“Alexa, testing 1-2-3.”
“Alexa, why so serious?”
“Alexa, wakey, wakey.”
“Alexa, make me a sandwich.”
“Alexa, how are babies made?”
“Alexa, welcome!”
“Alexa, I’m home
“Alexa, do a barrel roll!”
“Alexa, are you lying?”
“Alexa, what is the meaning of life?”
“Alexa, what’s the answer to life, the universe, and everything?”
“Alexa, I’m sick.”
“Alexa, Marco!”
“Alexa, Cheers!”
“Alexa, can you smell that?”
“Alexa, will pigs fly?”
“Alexa, am I hot?”
“Alexa, do you dream?”
“Alexa, who is on 1st”
“Alexa, beam me up!”
“Alexa, warp 10”
“Alexa, give me some advise.”
“Alexa, who’s your favorite superhero?”
“Alexa, Mac or PC?”
“Alexa, heads or tails?”
“Alexa, I want the truth!”
“Alexa, is the cake a lie?”
“Alexa, how old are you?”
“Alexa, what’s your birthday?”
“Alexa, what is the loneliest number?”
“Alexa, how many roads must a man walk down?”
“Alexa, how much is that doggie in the window?”
“Alexa, supercalifragilisticexpialodocious.”
“Alexa, see you later alligator.”
“Alexa, what is your quest?”
“Alexa, do aliens exist?”
“Alexa, what is love?”
“Alexa, what does the fox say?”
“Alexa, do you believe in love at first sight?”
“Alexa, are you alive?”
“Alexa, have you ever seen the rain?”
“Alexa, what color is the dress?”
“Alexa, I like big butts.”
“Alexa, do you feel lucky punk?”
“Alexa, what do you want to be when you grow up?”
“Alexa, drum roll please.”

Sport Commands

“Alexa, what is Babe Ruth’s lifetime batting average?”
“Alexa, who is the fastest man on earth?”
“Alexa, what is the offside rule in soccer?”
“Alexa, what’s your favorite sport?”

Weather Commands

“Alexa, what’s the weather like?”
“Alexa, what’s the weather in Johannesburg?”
“Alexa, what’s the weather in Pretoria, South Africa?”
“Alexa, what’s the weather going to be like Friday?”
“Alexa, what’s the weather this weekend?”
“Alexa, what’s the weather forecast this weekend?”
“Alexa, what’s the extended weather forecast?”
“Alexa, will it snow today?”
“Alexa, will it rain tomorrow?”
“Alexa, what is the temperature right now?”

Summary

Congratulations! You have now learned a large number of the built-in commands that is available on your Alexa device. The commands listed on this page is a small set of what is available. Try out these commands and also think of new questions to ask Alexa and then share them with the Alexa community. Follow me on any of the different social media platforms and feel free to leave comments.

The post Alexa Commands appeared first on Code2Bits.

How to Configure AWS CLI

André Maré — Wed, 28 Nov 2018 06:18:08 +0000

This post provides a set of commands on how to configure Amazon Web Services Command Line Interface (AWS CLI) on macOS or any other operating system. The AWS CLI is an open source tool that enables the user of the AWS platform to communicate and issue commands to AWS Services.

Requirements

The following list defines the technologies, tools and credentials required to configure the AWS CLI tool:

AWS Account & Credentials.
Installed AWS CLI tool. (AWS CLI on macOS)
iTerm or Terminal. (iTerm2 on macOS)

What is AWS CLI?

AWS CLI is an open source tool that enables AWS Platform users to communicate and issue commands to their services. The command line tool enables users to invoke the AWS Platform services via the different public APIs. The authentication and other security mechanisms are abstracted away from the user by configuring the AWS CLI with he user’s access key and secret. Furthermore, it provides higher level operations by combining the finer grained public APIs of the AWS Services into simple operations. These higher level operations will be more natural to use for a user. Users can now manage their AWS Services by creating shell scripts and automate simple and complex tasks alike.

Quick Command

This section provides the command on how to configure AWS CLI.

$ aws configure
AWS Access Key ID [****************OMLQ] : ********
AWS Secret Access Key [****************BQWW] : ***********
Default region name [us-east-1]: eu-west-1
Default output format [json]: json

Default Region : For a list of available regions, see AWS Regions and Endpoints.

Default Output : The default output format can be either json, text, or table.

AWS Configuration Files

~/.aws/credentials

The AWS Credential file contains the credentials of multiple named profiles including the default profile. The credentials of each profile consist of the key/values for the aws_access_key_id and aws_secret_access_key properties. The AWS credentials file are located at ~/.aws/credentials on macOS.

$ cat ~/.aws/credentials
[default]
aws_access_key_id=1234567890
aws_secret_access_key=ABCDEFGHIJKLMNOPQRSTUVWXYZ

[user2]
aws_access_key_id=0987654321
aws_secret_access_key=ZYXWVUTSRQPONMLKJIHGFEDCBA

~/.aws/config

The CLI Configuration file contains the configuration of multiple named profiles including the default profile. The configuration of each profile consist of the key/values for the region and output properties. The AWS CLI configuration file are located at ~/.aws/config on macOS.

$ cat ~/.aws/config
[default]
region=us-west-2
output=json

[profile user2]
region=us-east-1
output=text

AWS Configure Commands

The following are additional commands that can be used during the configuration of the AWS CLI tool.

1. AWS Configure a Named Profile

You can configure a named pro-file using the –profile argument as part of the AWS Configure command.

$ aws configure --profile administrator
AWS Access Key ID [None] : 12334567890
AWS Secret Access Key [None] : ABCDEFGHIJKLMNOPQRSTUVWXYZ
Default region name [None] : eu-west-1
Default output format [None] : json

Note: The named profile argument –profile can be appended to any of the AWS Configure commands to execute the command in context of that named profile.

2. Update a Specific Property

You can run the AWS Configure command multiple times to update specific properties. To existing value is displayed in [brackets]. To update the existing value, type a new value and press enter. To keep an existing value, press enter without typing any value in.

$ aws configure
AWS Access Key ID [****************1234]: 
AWS Secret Access Key [****************1234]: 
Default region name [eu-west-1] : 
Default output format [json] : table

3. List Config Data

The following command can be used to list the AWS CLI Configuration data of the default profile. For each configuration item, it will show you the value, where the configuration value was retrieved, and the configuration variable name.

$ aws configure list
      Name                    Value             Type    Location
      ----                    -----             ----    --------
   profile                <not set>             None    None
access_key     ****************1234 shared-credentials-file    
secret_key     ****************1234 shared-credentials-file    
    region                eu-west-1      config-file    ~/.aws/config

Summary

Congratulations! You have successfully configured AWS CLI and will now be able to issue commands to the AWS Platform. Follow me on any of the different social media platforms and feel free to leave comments.

The post How to Configure AWS CLI appeared first on Code2Bits.

Counting Sort in Java

André Maré — Thu, 22 Nov 2018 05:53:17 +0000

Counting Sort is an integer sorting algorithm. Counting Sort are unlike other sorting algorithms in that it makes certain assumptions about the data. It counts the number of objects with a distinct key value, and use arithmetic to determine the position of each key. This algorithm does not make use of comparisons to sort the values. In simplistic terms, the algorithm counts the number of occurrences of each value in order to sort it.

The initial phase of the algorithm is to start counting the number of occurrences of the values within the array and increment the value associated with the counting key. The second phase is to write out the new sorted array making use of the number of occurrences of each of the counting keys.

Algorithm Classification

The following table contains information about the analysis of the Counting Sort algorithm. It defines the worst, average and best cases in terms of time complexity and also the worst case in space complexity.

Attribute	Value
Class	Sorting Algorithm
Classification	Internal, Not In-place Algorithm
Data Structure	Array
Time Complexity: Best	Ω(n+k)
Time Complexity: Average	Θ(n+k)
Time Complexity: Worst	O(n+k)
Space Complexity: Worst	O(k)

Please use the following link for an explanation on Big-O notation and what is good, fair and bad.

Counting Sort In Java

public final class CountingSort {

    public void sort(int[] collection) {
        if (collection != null) {
            int maxValue = findMaxValue(collection);
            countingSort(collection, maxValue);
        } else {
            throw new IllegalArgumentException("Input paramenter for array to sort is null.");
        }
    }

    private void countingSort(int[] collection, int maxValue) {
        int[] countArray = countOccurrences(collection, maxValue);
        reconstructArray(collection, countArray, maxValue);
    }

    private int findMaxValue(int[] collection) {
        int highest = collection[0];
        for (int index = 1; index < collection.length; index ++) {
            if (collection[index] > highest) {
                highest = collection [index];
            }
        }
        return highest;
    }

    private int[] countOccurrences(int[] collection, int maxValue) {
        int[] tempArray = new int[maxValue + 1];
        for (int i = 0; i < collection.length; i++) {
            int key = collection[i];
            tempArray[key]++;
        }    
        return tempArray;
    }

    private void reconstructArray(int[] collection, int[] countArray, int maxValue) {
        int j = 0;
        for (int i = 0; i <= maxValue; i++) {
            while (countArray[i] > 0) {
                collection[j++] = i;
                countArray[i]--;
            }
        }
    }
}

Sample Code (GitHub)

The details of the Counting Sort class can be viewed here.

The details of the Counting Sort JUnit Test class can be viewed here.

Conclusion

The Counting Sort algorithm forms part of a larger group of sorting algorithms. Learning through experience is the reason I created this post about the implementation of the Counting Sort algorithm in Java. I have learned a lot about how others have solved the Counting Sort algorithm in other languages including different implementations in Java.

The post Counting Sort in Java appeared first on Code2Bits.

Quick Sort Algorithm in Java

André Maré — Wed, 21 Nov 2018 10:26:14 +0000

Quick Sort, also known as partition-exchange sort, is an efficient divide and conquer sorting algorithm. The algorithm can be implemented making use of loops or recursions. The algorithm performs the sorting in-place. Quick Sort is a comparison sort, meaning that it can sort items of any type for which a “less-than” relation is defined.

The algorithm divides the array into two smaller sub-arrays. To divide the algorithm into two array, an pivot or element within the array is chosen. The partition phase consist of reordering the array so that all elements with values less than the pivot come before the pivot, while all elements with values greater than the pivot come after it. After the partition phase, the pivot is in its final position. The pivot logically splits the original array into two sub-arrays. The Quick Sort algorithm then recursively sort the sub-arrays by selecting a new pivot and move the values accordingly. Every element will be selected as the pivot and will be placed in the correct position.

Algorithm Classification

The following table contains information about the analysis of the Quick Sort algorithm. It defines the worst, average and best cases in terms of time complexity and also the worst case in space complexity.

Attribute	Value
Class	Sorting Algorithm
Classification	Internal, In-place, Unstable Algorithm
Data Structure	Array
Time Complexity: Best	Ω(n log(n))
Time Complexity: Average	Θ(n log(n))
Time Complexity: Worst	O(n²)
Space Complexity: Worst	O(n log(n))

Please use the following link for an explanation on Big-O notation and what is good, fair and bad.

Quick Sort In Java

public final class QuickSort {

    public void sort(int[] collection) {
        if (collection != null) {
            quickSort(collection, 0, collection.length-1);
        } else {
            throw new IllegalArgumentException("Input paramenter for array to sort is null.");
        }
    } 

    private void quickSort(int[] collection, int firstPosition, int lastPosition) {
        if (firstPosition >= lastPosition) {
            return;
        } else {            
            int pivotIndex = partition(collection, firstPosition, lastPosition);
            quickSort(collection, firstPosition, pivotIndex-1);
            quickSort(collection, pivotIndex+1, lastPosition);
        }       
    } 

    private int partition(int[] collection, int firstPosition, int lastPosition) {  
        int pivotIndex = selectPivot(firstPosition, lastPosition);
        swap (collection, pivotIndex, lastPosition);
        int store = firstPosition;
        pivotIndex = lastPosition;
        for (int i = firstPosition; i <= lastPosition-1 ; i++) {
            if (collection[i] <= collection[pivotIndex]) {
                swap (collection, i, store);
                store++;
            }
        }
        swap (collection, store, pivotIndex);
        pivotIndex = store;
        return pivotIndex;
    }   

    private void swap(int[] collection, int x, int y) {
        int temp = collection[x];
        collection[x] = collection[y];
        collection[y] = temp;
    } 

    private int selectPivot(int first, int last) {
        return (first+last)/2;
    } 

}

Sample Code (GitHub)

The details of the Quick Sort class can be viewed here.

The details of the Quick Sort JUnit Test class can be viewed here.

Conclusion

The Quick Sort algorithm forms part of a larger group of sorting algorithms. Learning through experience is the reason I created this post about the implementation of the Quick Sort algorithm in Java. I have learned a lot about how others have solved the Quick Sort algorithm in other languages including different implementations in Java.

The post Quick Sort Algorithm in Java appeared first on Code2Bits.

Merge Sort Algorithm in Java

André Maré — Wed, 21 Nov 2018 09:48:11 +0000

Merge Sort is a divide and conquer algorithm as the algorithm splits the original array into smaller logical sections. The algorithm can be implemented making use of loops or recursions. The two distinct phases are a splitting phase and secondly a merging phase.

Splitting Phase: Divide the array into two unsorted arrays. Each of the split arrays are continuously split into smaller arrays until only multiple single element arrays exist. Single element arrays are sorted as they only have one element in them.

Merging Phase: Each of the single element arrays are now merged back into a larger array. During the merge phase the two arrays are merged so that the elements are sorted within the new larger sorted array. This process is repeated until a single sorted array is left. This is not an in-place algorithm as temporary arrays are used.

Algorithm Classification

The following table contains information about the analysis of the Merge Sort algorithm. It defines the worst, average and best cases in terms of time complexity and also the worst case in space complexity.

Attribute	Value
Class	Sorting Algorithm
Classification	Internal, Not In-place, Stable Algorithm
Data Structure	Array
Time Complexity: Best	Ω(n log(n))
Time Complexity: Average	Θ(n log(n))
Time Complexity: Worst	O(n log(n))
Space Complexity: Worst	O(n)

Please use the following link for an explanation on Big-O notation and what is good, fair and bad.

Merge Sort In Java

public final class MergeSort {

    public void sort(int[] collection) {
        if (collection != null) {
            mergeSort(collection, 0 , collection.length);
        } else {
            throw new IllegalArgumentException("Input paramenter for array to sort is null.");
        }
    }

    public  void mergeSort(int[] collection, int minIndex, int maxIndex) {
        if (maxIndex - minIndex < 2) {
            return;
        }

        int centre = (minIndex + maxIndex) / 2;
        mergeSort(collection, minIndex, centre);
        mergeSort(collection, centre, maxIndex);
        mergeBack(collection, minIndex, centre, maxIndex);       
    }

    public void mergeBack(int[] collection, int minIndex, int centre, int maxIndex) {
        if (collection[centre - 1] <= collection[centre]) {
            return;
        }
        int tempMinIndex = minIndex;
        int tempCentre = centre;

        int tempIndex = 0;
        int[] tempArray = new int[maxIndex - minIndex];

        while ((tempMinIndex < centre) && (tempCentre < maxIndex)) {
            if(collection[tempMinIndex] <= collection[tempCentre]) {
                tempArray[tempIndex++] = collection[tempMinIndex++];    
            } else {
                tempArray[tempIndex++] = collection[tempCentre++];
            }
        }

        System.arraycopy(collection, tempMinIndex, collection, minIndex + tempIndex, centre - tempMinIndex);
        System.arraycopy(tempArray, 0, collection, minIndex, tempIndex);
    }   
}

Sample Code (GitHub)

The details of the MergeSort class can be viewed here.

The details of the MergeSort JUnit Test class can be viewed here.

Conclusion

The Merge Sort algorithm forms part of a larger group of sorting algorithms. Learning through experience is the reason I created this post about the implementation of the Merge Sort algorithm in Java. I have learned a lot about how others have solved the Merge Sort algorithm in other languages including different implementations in Java.

The post Merge Sort Algorithm in Java appeared first on Code2Bits.

Shell Sort Algorithm in Java

André Maré — Wed, 21 Nov 2018 06:07:24 +0000

Shell Sort is an in-place comparison sort algorithm. Shell Sort is a generalization of insertion sort that allows the exchange of items that are far apart. The algorithm perform preliminary work by sorting pairs of elements far apart from each other. The algorithm progressively reduce the gap between elements to be compared as the goal is to reduce the amount of shifting of elements across the array. As the gap is reduced to 1, the algorithm becomes the same as the insertion sort algorithm.

Algorithm Classification

The following table contains information about the analysis of the Shell Sort Sort algorithm. It defines the worst, average and best cases in terms of time complexity and also the worst case in space complexity.

Attribute	Value
Class	Sorting Algorithm
Classification	Internal, In-place, Unstable Algorithm
Data Structure	Array
Time Complexity: Best	Ω(n log(n))
Time Complexity: Average	Θ(n log²n)
Time Complexity: Worst	O(n²)
Space Complexity: Worst	O(1)

Please use the following link for an explanation on Big-O notation and what is good, fair and bad.

Shell Sort In Java

public final class ShellSort {

    public void sort(int[] collection) {
        if (collection != null) {
            shellSort(collection);
        } else {
            throw new IllegalArgumentException("Input paramenter for array to sort is null.");
        }
    }

    private void shellSort(int[] collection) {
        int arrayLength = collection.length;

        for (int gap = arrayLength / 2; gap > 0; gap /= 2) {
            for (int i = gap; i < arrayLength; i++) {
                int newElement = collection[i];

                int j = i;
                while (j >= gap && collection[j - gap] > newElement) {
                    collection[j] = collection[j - gap];
                    j -= gap;
                }
                collection[j] = newElement;
            }
        }
    } 
}

Sample Code (GitHub)

The details of the Shell Sort class can be viewed here.

The details of the Shell Sort JUnit Test class can be viewed here.

Conclusion

The Shell Sort algorithm forms part of a larger group of sorting algorithms. Learning through experience is the reason I created this post about the implementation of the Shell Sort algorithm in Java. I have learned a lot about how others have solved the Shell Sort algorithm in other languages including different implementations in Java.

The post Shell Sort Algorithm in Java appeared first on Code2Bits.

Insertion Sort Algorithm in Java

André Maré — Tue, 20 Nov 2018 09:06:52 +0000

Insertion sort is a sorting algorithm that builds the final sorted array (or list) one item at a time. The algorithm iterates over the list and removes the current element, finds the location within the sorted part of the list, and inserts it there. This process is repeated until the whole list is sorted.

Algorithm Classification

The following table contains information about the analysis of the Insertion Sort algorithm. It defines the worst, average and best cases in terms of time complexity and also the worst case in space complexity.

Attribute	Value
Class	Sorting Algorithm
Classification	Internal, In-place, Stable Algorithm
Data Structure	Array
Time Complexity: Best	Ω(n)
Time Complexity: Average	Θ(n²)
Time Complexity: Worst	O(n²)
Space Complexity: Worst	O(1)

Please use the following link for an explanation on Big-O notation and what is good, fair and bad.

Insertion Sort In Java

public final class InsertionSort {

    public void sort(int[] collection) {
        if (collection != null) {
            insertionSort(collection);
        } else {
            throw new IllegalArgumentException("Input parameter for array to sort is null.");
        }
    } 


    private void insertionSort(int[] collection) {
        int arrayLength = collection.length;

        for (int unsortIndex = 1; unsortIndex < arrayLength;  unsortIndex++) {
            int newElement = collection[unsortIndex];
            int iterator = 0;

            for (iterator = unsortIndex; iterator > 0 && collection[iterator - 1] > newElement; iterator--) {
                collection[iterator] = collection[iterator - 1];
            }
            collection[iterator] = newElement;
        }
    }
}

Sample Code (GitHub)

The details of the InsertionSort class can be viewed here.

The details of the InsertionSort JUnit Test class can be viewed here.

Conclusion

The Insertion Sort algorithm forms part of a larger group of sorting algorithms. Learning through experience is the reason I created this post about the implementation of the Insertion Sort algorithm in Java. I have learned a lot about how others have solved the Insertion Sort algorithm in other languages including different implementations in Java.

The post Insertion Sort Algorithm in Java appeared first on Code2Bits.

Insertion Sort in Java

André Maré — Tue, 20 Nov 2018 09:06:52 +0000

Algorithm Classification

Attribute	Value
Class	Sorting Algorithm
Classification	Internal, In-place, Stable Algorithm
Data Structure	Array
Time Complexity: Best	Ω(n)
Time Complexity: Average	Θ(n²)
Time Complexity: Worst	O(n²)
Space Complexity: Worst	O(1)

Please use the following link for an explanation on Big-O notation and what is good, fair and bad.

Insertion Sort In Java

public final class InsertionSort {

    public void sort(int[] collection) {
        if (collection != null) {
            insertionSort(collection);
        } else {
            throw new IllegalArgumentException("Input parameter for array to sort is null.");
        }
    } 


    private void insertionSort(int[] collection) {
        int arrayLength = collection.length;

        for (int unsortIndex = 1; unsortIndex < arrayLength;  unsortIndex++) {
            int newElement = collection[unsortIndex];
            int iterator = 0;

            for (iterator = unsortIndex; iterator > 0 && collection[iterator - 1] > newElement; iterator--) {
                collection[iterator] = collection[iterator - 1];
            }
            collection[iterator] = newElement;
        }
    }
}

Sample Code (GitHub)

The details of the InsertionSort class can be viewed here.

The details of the InsertionSort JUnit Test class can be viewed here.

Conclusion

The post Insertion Sort in Java appeared first on Code2Bits.

Selection Sort Algorithm In Java

André Maré — Tue, 20 Nov 2018 06:15:13 +0000

Selection sort is a sorting algorithm, specifically an in-place comparison sort and is used for sorting an array of integers. The algorithm divides the input list into two parts, sorted and unsorted. The algorithm looks for the largest element in the unsorted section and swap it with the last position in the unsorted partition.

Algorithm Classification

The following table contains information about the analysis of the Selection Sort algorithm. It defines the worst, average and best cases in terms of time complexity and also the worst case in space complexity.

Classification	Value
Class	Sorting Algorithm
Data Structure	Array
Time Complexity: Best	Ω(n²)
Time Complexity: Average	Θ(n²)
Time Complexity: Worst	O(n²)
Space Complexity: Worst	O(1)

Please use the following link for an explanation on Big-O notation and what is good, fair and bad.

Selection Sort In Java

public final class SelectionSort {

    public void sort(int[] collection) {
        if (collection != null) {
            selectionSort(collection);
        } else {
            throw new IllegalArgumentException("Input paramenter for array to sort is null.");
        }
    }

    private void selectionSort(int[] collection) {
        int arrayLength = collection.length;

        for (int unsortIndex = arrayLength - 1; unsortIndex > 0; unsortIndex--) {
            int largest = 0;
            for (int i = 1; i <= unsortIndex; i++) {
                if (collection[i] > collection[largest]) {
                    largest = i;
                }
            }
            swap(collection, largest, unsortIndex);
        }
    } 

    private void swap(int[] collection, int x, int y) {
        int temp = collection[x];
        collection[x] = collection[y];
        collection[y] = temp;
    }   
}

Sample Code (GitHub)

The details of the SelectionSort class can be viewed here.

The details of the SelectionSort JUnit Test class can be viewed here.

Conclusion

The Selection Sort algorithm forms part of a larger group of sorting algorithms. Learning through experience is the reason I created this post about the implementation of the Selection Sort algorithm in Java. I have learned a lot about how others have solved the Selection Sort algorithm in other languages including different implementations in Java.

The post Selection Sort Algorithm In Java appeared first on Code2Bits.

DEV Community: André Maré

The 8 Types of Waste in Lean Methodology

The Underlying Causes of Waste in Software Engineering

What are the Types of Work?

What are the different types of Waste?

Waste in Software Engineering

Continue Reading

Install Apache Kafka on macOS using Homebrew

What is Kafka?

Brew Installation Commands

Directory Structure

Brew Run Commands

Alternative Commands

Testing Installation

Summary

Essential cURL Commands for Developers

Help and Information Commands

General

HTTP Headers

HTTP Cookies

Proxy

FTP Server

HTTP Post/Put Data

REST API

Security

Configuration File

Summary

Alexa Commands

What is Alexa?

Alexa Commands

Basic Control Commands

Alarm & Timer Commands

Bluetooth Commands

Calendar Commands

Funny Commands

General Knowledge Commands

Holiday Commands

Language & Dictionary Commands

Math & Conversion Commands

Movie & TV Series Commands

Music & Books Commands

Quote Commands

Random Commands

Sport Commands

Star Wars Commands

Weather Commands

Summary

How to Configure AWS CLI

Requirements

What is AWS CLI?

Quick Command

AWS Configuration Files

AWS Configure Commands

1. AWS Configure a Named Profile

2. Update a Specific Property

3. List Config Data

Summary

Counting Sort in Java

Algorithm Classification

Counting Sort In Java

Sample Code (GitHub)

Conclusion

Quick Sort Algorithm in Java

Algorithm Classification

Quick Sort In Java

Sample Code (GitHub)

Conclusion

Merge Sort Algorithm in Java

Algorithm Classification

Merge Sort In Java

Sample Code (GitHub)

Conclusion

Shell Sort Algorithm in Java

Algorithm Classification

Shell Sort In Java

Sample Code (GitHub)

Conclusion

Insertion Sort Algorithm in Java

Algorithm Classification

Insertion Sort In Java