---
title: "Discussion on \"Sorting\" | Hashnode"
description: "Discussion on \"Sorting\". Selection sort-\nit is a O(n^2) technique to sort an array in ascending order.\nWorking: We take two pointers that traverse through the array.\nPointer 1 : slow - runs n times\nPointer 2: fast - runs [(n(n+1))/2] times.\npointer 2 find the element contain..."
url: "https://hashnode.com/posts/sorting/65ff29c1198b6ac607c3b175"
---

[Feed](https://hashnode.com/feed) /

Discussion

# [Sorting](https://blueewhitee.hashnode.dev/sorting?utm_source=hashnode&utm_medium=feed)

Selection sort- it is a O(n^2) technique to sort an array in ascending order. Working: We take two pointers that traverse through the array. Pointer 1 : slow - runs n times Pointer 2: fast - runs \[(n(n+1))/2\] times. pointer 2 find the element contain...

Mar 23, 2024 · 1 min read · blueewhitee.hashnode.dev  
Read the article

## Written by

[ASHUTOSH KUSHWAHA](https://hashnode.com/@blueewhittee)

@blueewhittee

  
[View profile](https://hashnode.com/@blueewhittee)

iLag

## Responses

Markdown supported · ⌘↵ to post

No responses yet.