{"id":21260516,"url":"https://github.com/tanmayvaij/arrays","last_synced_at":"2025-08-17T16:06:47.995Z","repository":{"id":153628606,"uuid":"538008779","full_name":"tanmayvaij/arrays","owner":"tanmayvaij","description":"Searching and Sorting algorithms on arrays","archived":false,"fork":false,"pushed_at":"2022-09-18T15:09:47.000Z","size":3,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-01-21T21:47:44.436Z","etag":null,"topics":["algorithm","cpp","searching-algorithms","sort","sorting-algorithms"],"latest_commit_sha":null,"homepage":"","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/tanmayvaij.png","metadata":{"files":{"readme":"readme.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2022-09-18T05:20:30.000Z","updated_at":"2022-10-19T10:14:09.000Z","dependencies_parsed_at":"2023-05-31T06:16:05.776Z","dependency_job_id":null,"html_url":"https://github.com/tanmayvaij/arrays","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tanmayvaij%2Farrays","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tanmayvaij%2Farrays/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tanmayvaij%2Farrays/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tanmayvaij%2Farrays/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/tanmayvaij","download_url":"https://codeload.github.com/tanmayvaij/arrays/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":243695537,"owners_count":20332626,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["algorithm","cpp","searching-algorithms","sort","sorting-algorithms"],"created_at":"2024-11-21T04:19:16.737Z","updated_at":"2025-03-15T06:44:51.048Z","avatar_url":"https://github.com/tanmayvaij.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Searching and Sorting in Arrays\n\n### *Searching in Arrays*\n\n\u003e 1. Linear Search\n\n```cpp\n// Time Complexity:- O(N)\n// Auxiliary Space:- O(1)\n\nint linearSearch( int arr [], int n, int x ) {\n    for ( int i = 0; i \u003c n; i++ ) {\n        if ( arr[i] == x ) return i;\n    }\n    return -1;\n}\n```\n\n\u003e 2. Binary Search\n\n```cpp\n// Time Complexity:- O(logN)\n// Auxiliary Space:- O(1)\n\nint binarySearch(int arr [], int n, int x) {\n    int l = 0, r = n - 1;\n    while ( l \u003c= r ) {\n        int m = (l + r) / 2;\n        if ( arr[m] == x )\n            return m;\n        else if ( arr[m] \u003c x )\n            l = m + 1;\n        else\n            r = m - 1;\n    }\n    return -1;\n}\n```\n\n\u003cbr/\u003e\n\n### *Sorting in Arrays*\n\n\u003e 1. Bubble Sort\n\n```cpp\n// Time Complexity:- O(N^2)\n// Auxiliary Space:- O(1) \n\nvoid swap( int * x, int * y ) {\n    int temp = *x;\n    *y = *x;\n    *x = temp;\n}\n\nvoid bubbleSort( int arr [], int n ) {\n\n    for ( int i = 0; i \u003c n-1; i++ ) {\n\n        int swapped = false;\n\n        for ( int j = 0; j \u003c n-i-1; j++ ) {\n            if ( arr[j] \u003e arr[j+1] ) { \n                swap(arr[j], arr[j+1]);\n                swapped = true;\n            }\n        }\n\n        if ( swapped == false ) break;\n\n    }\n\n}\n```\n\n\u003e 2. Insertion Sort\n\n```cpp\n// Time Complexity:- O(N^2) \n// Auxiliary Space:- O(1)\n\nvoid swap( int * x, int * y ) {\n    int temp = *x;\n    *y = *x;\n    *x = temp;\n}\n\nvoid insertionSort( int arr [], int n ) {\n\n    for ( int i = 0; i \u003c n - 1; i++ ) {\n\n        if ( arr[i] \u003e arr[i+1] ) {\n\n            swap(arr[i], arr[i+1]);\n\n            for ( int j = i ; j \u003e= 1; j-- ) {\n                if ( arr[j] \u003c arr[j-1] ) swap(arr[j], arr[j-1]);   \n            }\n\n        }\n\n    }\n\n}\n```","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftanmayvaij%2Farrays","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Ftanmayvaij%2Farrays","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftanmayvaij%2Farrays/lists"}